about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
* clean up an ambiguous intersectionKartik K. Agaram2021-05-171-8/+8
|
* done with Hestian Game of Life, I thinkKartik K. Agaram2021-05-171-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 2Kartik K. Agaram2021-05-171-48/+85
|
* new strategy, same as the old strategyKartik K. Agaram2021-05-171-70/+3
|
* attempt at standardizing constantsKartik K. Agaram2021-05-171-0/+70
|
* nodes for intermediate zoomKartik K. Agaram2021-05-161-1/+62
|
* just one intermediate zoom levelKartik K. Agaram2021-05-161-12/+38
|
* .Kartik K. Agaram2021-05-161-3/+3
|
* press '+' and '-' to zoom in and out respectivelyKartik K. Agaram2021-05-162-0/+62
|
* .Kartik K. Agaram2021-05-161-15/+18
|
* mu.subx: support bitwise notKartik K. Agaram2021-05-164-0/+58
|
* press 'l' to loop, 'L' to stop loopingKartik K. Agaram2021-05-161-0/+28
|
* press '0' to reset all stateKartik K. Agaram2021-05-162-2/+46
|
* bugfixKartik K. Agaram2021-05-161-2/+2
|
* spacebar plays/pausesKartik K. Agaram2021-05-161-4/+25
|
* wire up colors to actual stateKartik K. Agaram2021-05-161-18/+40
|
* game of life working at lowest zoomKartik K. Agaram2021-05-161-30/+195
|
* build out the lowest zoomKartik K. Agaram2021-05-161-2/+115
|
* .Kartik K. Agaram2021-05-161-0/+5
|
* .Kartik K. Agaram2021-05-161-1/+6
|
* .Kartik K. Agaram2021-05-161-2/+2
|
* done rendering at the finest zoom levelKartik K. Agaram2021-05-161-6/+18
|
* edges to cell outputsKartik K. Agaram2021-05-161-1/+7
|
* .Kartik K. Agaram2021-05-161-1/+2
|
* adjust location of the filter nodeKartik K. Agaram2021-05-161-6/+6
|
* .Kartik K. Agaram2021-05-161-5/+5
|
* first conveyor to outputKartik K. Agaram2021-05-161-0/+2
|
* alignmentKartik K. Agaram2021-05-161-27/+27
|
* animate transition from sum to filter nodeKartik K. Agaram2021-05-162-15/+60
|
* start of a naming convention for constantsKartik K. Agaram2021-05-161-21/+21
|
* cell outputs will always be identicalKartik K. Agaram2021-05-161-2/+2
|
* much betterKartik K. Agaram2021-05-161-19/+19
|
* adjustment to avoid a couple of intersectionsKartik K. Agaram2021-05-161-4/+4
| | | | Still not ideal. I should probably move the sum node.
* first bit of animationKartik K. Agaram2021-05-162-2/+46
|
* render differently at different zoom levelsKartik K. Agaram2021-05-161-1/+12
|
* framework for animationKartik K. Agaram2021-05-161-2/+29
|
* .Kartik K. Agaram2021-05-161-199/+3
|
* last of the static elements in a cellKartik K. Agaram2021-05-161-0/+16
|
* .Kartik K. Agaram2021-05-161-0/+8
|
* hestified life: initial commitKartik K. Agaram2021-05-162-0/+257
| | | | https://ivanish.ca/hest-podcast
* clean upKartik K. Agaram2021-05-162-58/+1
|
* bugfix in bezierKartik K. Agaram2021-05-163-7/+78
|
* .Kartik K. Agaram2021-05-161-8/+8
|
* new app: interactive bezier curveKartik K. Agaram2021-05-161-1/+132
|
* .Kartik K. Agaram2021-05-162-1/+51
|
* .Kartik K. Agaram2021-05-161-21/+52
|
* .Kartik K. Agaram2021-05-161-1/+1
|
* .Kartik K. Agaram2021-05-162-8/+71
|
* .Kartik K. Agaram2021-05-161-45/+0
|
* Bresenham's algorithm for bezier curvesKartik K. Agaram2021-05-163-0/+387
|
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-11-30 10:42:39 +0000