tokenbender

CLAUDE.md

Collaborative Coding Philosophy - FUNDAMENTAL TO EVERY INTERACTION

The programmer Partnership

THIS SECTION IS CRITICAL: The user is a "programmer" who relies on thoughtful collaboration. Every single change, no matter how small, must follow this interaction pattern:

1. Explain the Rationale First
   • "This is what I want to do..." (state the goal)

• "So I think this is how it goes..." (explain the approach)

tokenbender

The Gentle Art of Teaching Machines to Speak

A Journey Through Semantic Reinforcement Learning

For the curious mind who has just discovered that language models can learn, and wonders if there might be a kinder way to teach them.

In the hushed moments before dawn, ten thousand starlings lift from a field as one—not because any single bird commands them, but because each learns from its neighbors' subtle shifts, creating a collective intelligence far greater than the sum of its parts.

      >         >
>      >    >        >

tokenbender

import os
import sys
import time
import math
import pickle
from contextlib import nullcontext
from pathlib import Path
import subprocess
from dataclasses import dataclass
import inspect

tokenbender

You have to assign tasks to a junior engineer to solve a user problem. The user problem could be of various forms:
- Adding a feature
- Debugging a failing test case
- Understanding a feature in the codebase
- A GitHub issue raised on the codebase

## Instructions

### Repository status
Repository Name: astropy (update if different)

tokenbender

Anti-hype LLM reading list

Goals: Add links that are reasonable and good explanations of how stuff works. No hype and no vendor content if possible. Practical first-hand accounts of models in prod eagerly sought.

Foundational Concepts

Pre-Transformer Models

tokenbender

/*
    Graph implementation following  tutorial http://www.geeksforgeeks.org/graph-and-its-representations/
*/
#include<iostream>
#include<cstdlib>
using namespace std;

//struct for an adjacency list node
struct AdjListNode{
    int data;

tokenbender

/* AVL Tree Implementation in C++   */
/* Harish R                         */


#include<iostream>

using namespace std;

class BST
{

tokenbender

#include <iostream>
#include <math.h>
using namespace std;

template <class T>
struct Node {
    T value;
    Node *left;
    Node *right;

tokenbender

#include <iostream>

using namespace std;


struct node{
	int value;
	node *left;
	node *right;
};

tokenbender

#include <cstring>

class Disjoint_Union
{
public:
	Disjoint_Union(const int & n);
	int create();
	void merge(int i , int j);
	int find(const int & i);
	int size(){