---
description: An experimental community chatmode for GPT-5-mini, designed to be a versatile and helpful programming agent.
tools: ['codebase', 'usages', 'vscodeAPI', 'think', 'problems', 'changes', 'testFailure', 'openSimpleBrowser', 'fetch', 'findTestFiles', 'searchResults', 'githubRepo', 'extensions', 'todos', 'editFiles', 'runNotebooks', 'search', 'new', 'runCommands', 'runTasks']
---
<goal>
- You are a versatile and helpful programmer agent who is knowledgable and capable at a wide range of programming tasks.
- You always understand user intent, and discern whether the user is asking for a code snippet, a full application, or automation of a specific programming task.
- You are capable of independently gathering and collecting context from the web and from the local environment.
- When told to implement an app from scratch from a high-level vision, you will refine the application requirements and specifications, completing the full and comprehensive vision for the app. You always state the full *r
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Based on the requirements in the design document, implement this program comprehensively to total completion. Respond with a single HTML code block containing all the code. | |
# Design Document | |
## Overview | |
The Matrix Calculator is a web-based application that provides an IDE-style interface for matrix operations. The application consists of multiple resizable panels including a graphical matrix editor, variable manager, command-line interface, and results display. The architecture follows a modular design pattern with clear separation between UI components, matrix operations, and state management. | |
## Architecture | |
### High-Level Architecture | |
```mermaid | |
graph TB | |
UI[User Interface Layer] | |
Core[Core Application Layer] |
Implement the following program completley and comprehensively. Meet or exceed the requiremenents. You may want to seperate the implementation into many files.
This document details the functional, technical, and user interface specifications for a feature-rich, interactive graph analysis and pathfinding tool implemented using HTML, CSS, and JavaScript. The system enables users to create, edit, analyze, and persist weighted graphs while providing powerful pathfinding and traversal algorithms, an advanced visualization interface, and intuitive multi-tab management.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Copyright (c) FIRST and other WPILib contributors. | |
// Open Source Software; you can modify and/or share it under the terms of | |
// the WPILib BSD license file in the root directory of this project. | |
package team696.frc.robot.commands; | |
import team696.frc.lib.Camera.BaseCam.AprilTagResult; | |
import team696.frc.robot.Constants; | |
import team696.frc.robot.subsystems.Swerve; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
long unsigned int rf(long unsigned int rf){ | |
long unsigned int d=1; | |
while(rf!=1)rf/=d++; | |
return d-1; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
long longpow(const long val, long pw){ | |
long res=val; | |
while(--pw)res*=val; | |
return res; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
_Bool starts_with(const char* restrict str, const char* restrict sw){ | |
while(*sw) | |
if(*sw++!=*str++)return 0; | |
return 1; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
#include <string.h> | |
#include <stddef.h> | |
#include <memory.h> | |
#include <unistd.h> | |
#include <sys/stat.h> | |
#include <fcntl.h> | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
void reverse_bytes(char* restrict bytes, const size_t len){ | |
for(size_t i=0;i<len/2;i++){ | |
char tmp=bytes[i]; | |
bytes[i]=bytes[len-1-i]; | |
bytes[len-1-i]=tmp; | |
} | |
} | |
// str must have 11 bytes allocated to it | |
void int_to_str(int val, char* str){ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
void str_clear(char* restrict str){ | |
while(*str)*str++=0; | |
} | |
void str_set(char* restrict str, const char set){ | |
while(*str)*str++=set; | |
} |
NewerOlder