| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | clean up an ambiguous intersection | Kartik K. Agaram | 2021-05-17 | 1 | -8/+8 | |
| | | ||||||
| * | done with Hestian Game of Life, I think | Kartik K. Agaram | 2021-05-17 | 1 | -24/+291 | |
| | | | | | | | | | | | Definitely tedious. And now that I'm done, the middle zoom level seems quite cluttered. And the zoom up to the full game is too steep, but I'm not going to be creating any more zoom levels :/ The real question is what sort of library or framework would allow one to autogenerate this sort of debug UI for arbitrary data structures. How do you declare how you want a data structure rendered? | |||||
| * | nodes for intermediate zoom, take 2 | Kartik K. Agaram | 2021-05-17 | 1 | -48/+85 | |
| | | ||||||
| * | new strategy, same as the old strategy | Kartik K. Agaram | 2021-05-17 | 1 | -70/+3 | |
| | | ||||||
| * | attempt at standardizing constants | Kartik K. Agaram | 2021-05-17 | 1 | -0/+70 | |
| | | ||||||
| * | nodes for intermediate zoom | Kartik K. Agaram | 2021-05-16 | 1 | -1/+62 | |
| | | ||||||
| * | just one intermediate zoom level | Kartik K. Agaram | 2021-05-16 | 1 | -12/+38 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -3/+3 | |
| | | ||||||
| * | press '+' and '-' to zoom in and out respectively | Kartik K. Agaram | 2021-05-16 | 2 | -0/+62 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -15/+18 | |
| | | ||||||
| * | mu.subx: support bitwise not | Kartik K. Agaram | 2021-05-16 | 4 | -0/+58 | |
| | | ||||||
| * | press 'l' to loop, 'L' to stop looping | Kartik K. Agaram | 2021-05-16 | 1 | -0/+28 | |
| | | ||||||
| * | press '0' to reset all state | Kartik K. Agaram | 2021-05-16 | 2 | -2/+46 | |
| | | ||||||
| * | bugfix | Kartik K. Agaram | 2021-05-16 | 1 | -2/+2 | |
| | | ||||||
| * | spacebar plays/pauses | Kartik K. Agaram | 2021-05-16 | 1 | -4/+25 | |
| | | ||||||
| * | wire up colors to actual state | Kartik K. Agaram | 2021-05-16 | 1 | -18/+40 | |
| | | ||||||
| * | game of life working at lowest zoom | Kartik K. Agaram | 2021-05-16 | 1 | -30/+195 | |
| | | ||||||
| * | build out the lowest zoom | Kartik K. Agaram | 2021-05-16 | 1 | -2/+115 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -0/+5 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -1/+6 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -2/+2 | |
| | | ||||||
| * | done rendering at the finest zoom level | Kartik K. Agaram | 2021-05-16 | 1 | -6/+18 | |
| | | ||||||
| * | edges to cell outputs | Kartik K. Agaram | 2021-05-16 | 1 | -1/+7 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -1/+2 | |
| | | ||||||
| * | adjust location of the filter node | Kartik K. Agaram | 2021-05-16 | 1 | -6/+6 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -5/+5 | |
| | | ||||||
| * | first conveyor to output | Kartik K. Agaram | 2021-05-16 | 1 | -0/+2 | |
| | | ||||||
| * | alignment | Kartik K. Agaram | 2021-05-16 | 1 | -27/+27 | |
| | | ||||||
| * | animate transition from sum to filter node | Kartik K. Agaram | 2021-05-16 | 2 | -15/+60 | |
| | | ||||||
| * | start of a naming convention for constants | Kartik K. Agaram | 2021-05-16 | 1 | -21/+21 | |
| | | ||||||
| * | cell outputs will always be identical | Kartik K. Agaram | 2021-05-16 | 1 | -2/+2 | |
| | | ||||||
| * | much better | Kartik K. Agaram | 2021-05-16 | 1 | -19/+19 | |
| | | ||||||
| * | adjustment to avoid a couple of intersections | Kartik K. Agaram | 2021-05-16 | 1 | -4/+4 | |
| | | | | | Still not ideal. I should probably move the sum node. | |||||
| * | first bit of animation | Kartik K. Agaram | 2021-05-16 | 2 | -2/+46 | |
| | | ||||||
| * | render differently at different zoom levels | Kartik K. Agaram | 2021-05-16 | 1 | -1/+12 | |
| | | ||||||
| * | framework for animation | Kartik K. Agaram | 2021-05-16 | 1 | -2/+29 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -199/+3 | |
| | | ||||||
| * | last of the static elements in a cell | Kartik K. Agaram | 2021-05-16 | 1 | -0/+16 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -0/+8 | |
| | | ||||||
| * | hestified life: initial commit | Kartik K. Agaram | 2021-05-16 | 2 | -0/+257 | |
| | | | | | https://ivanish.ca/hest-podcast | |||||
| * | clean up | Kartik K. Agaram | 2021-05-16 | 2 | -58/+1 | |
| | | ||||||
| * | bugfix in bezier | Kartik K. Agaram | 2021-05-16 | 3 | -7/+78 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -8/+8 | |
| | | ||||||
| * | new app: interactive bezier curve | Kartik K. Agaram | 2021-05-16 | 1 | -1/+132 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 2 | -1/+51 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -21/+52 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -1/+1 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 2 | -8/+71 | |
| | | ||||||
| * | . | Kartik K. Agaram | 2021-05-16 | 1 | -45/+0 | |
| | | ||||||
| * | Bresenham's algorithm for bezier curves | Kartik K. Agaram | 2021-05-16 | 3 | -0/+387 | |
| | | ||||||