zacharia/access-tree
An implementation of a simple access tree, used to efficiently initialize a randomly allocated array-based linked list.
My solutions to the problems from projecteuler.net
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
An implementation of a simple access tree, used to efficiently initialize a randomly allocated array-based linked list.
The implementation of my masters thesis. It's designed to allow Boolean geometry operations in shape grammars. Designed to be used with the shape grammar interpreter I made.
The Python shape grammar interpreter that I developed for my masters thesis. It reads a grammar (specified in Python) and interprets it to produce a specification of shapes.