beder
|
9de9ac7e7e
|
Started writing new iterators
|
2011-09-09 16:17:59 -05:00 |
|
beder
|
603c726811
|
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;
|
2011-09-09 14:26:55 -05:00 |
|
beder
|
7a1e47e03f
|
Added append()
|
2011-09-09 02:51:35 -05:00 |
|
beder
|
e32b3cd93f
|
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')
|
2011-09-09 02:29:17 -05:00 |
|
beder
|
3b0cc619b2
|
Implemented conversion for std::string, including a bypass-accessor to the scalar value
|
2011-09-07 15:49:01 -05:00 |
|
beder
|
a9c7f8cc5a
|
Set the 'memory' to only store node_refs, not nodes
|
2011-09-07 14:56:04 -05:00 |
|
beder
|
980fb59d4b
|
Added (another) layer - now 'node_ref' is between node and node_data, and it decrees whether nodes are identical
|
2011-09-07 14:44:18 -05:00 |
|