- 10 Sep, 2011 14 commits
-
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
Updated the node/value classes with the new iterators, they compile until we try to instantiate anything
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
- 09 Sep, 2011 7 commits
-
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
Made the 'data' member optional in node_ref - it's only created on-demand, so we don't waste extra memory every time we do Value tmp = v;
-
Jesse Beder authored
Switched value = otherValue to assign the actual nodes after setting the reference (so that tmp = foo['bar']; tmp = other; is the same as foo['bar'] = other;)
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
Switched memory to using shared nodes, and node_data to keep only naked node pointers, not shared nodes (to break the cycle, and we don't need weak pointers because their memory is guaranteed to exist, via 'memory')
-
- 08 Sep, 2011 4 commits
-
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
- 07 Sep, 2011 12 commits
-
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
Added (another) layer - now 'node_ref' is between node and node_data, and it decrees whether nodes are identical
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-
- 06 Sep, 2011 3 commits
-
-
Jesse Beder authored
-
Jesse Beder authored
-
Jesse Beder authored
-