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

..

detail

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

convert.h

Added half of the std::map conversion (we don't have reading from Values yet)

2011-09-08 02:10:04 -05:00

impl.h

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

iterator.h

Value stuff compiles/links with lots of placeholder functions

2011-09-07 00:12:24 -05:00

ptr.h

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

type.h

Started implementing node_data

2011-09-07 00:45:28 -05:00

value.h

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