beder
|
effbfd26b8
|
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;)
|
2011-09-09 14:02:18 -05:00 |
|
beder
|
804cdb9364
|
Added append()
|
2011-09-09 02:51:35 -05:00 |
|
beder
|
27616e65cd
|
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
|
43058e86a4
|
Switched convert to a templated struct that can be specialized (so we can partially specialize it)
|
2011-09-08 02:02:15 -05:00 |
|
beder
|
b9ad65a739
|
Implemented conversion for std::string, including a bypass-accessor to the scalar value
|
2011-09-07 15:49:01 -05:00 |
|
beder
|
5349dfa31c
|
Set the 'memory' to only store node_refs, not nodes
|
2011-09-07 14:56:04 -05:00 |
|
beder
|
907868b67d
|
Implemented is()
|
2011-09-07 14:46:25 -05:00 |
|
beder
|
81097ebbc0
|
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 |
|
beder
|
9add3a5947
|
Implemented map get(), and it would work (I think) if we implemented convert() for strings
|
2011-09-07 03:36:50 -05:00 |
|
beder
|
9ac003cb61
|
Set up map searching by templated key
|
2011-09-07 03:21:24 -05:00 |
|
beder
|
563b789cfb
|
Reorganized so that we don't have cyclic include problems
|
2011-09-07 02:59:58 -05:00 |
|
beder
|
e6ca3f3e69
|
Implemented map access by already-existing node
|
2011-09-07 02:39:59 -05:00 |
|
beder
|
327ad93dc6
|
Started implementing node_data
|
2011-09-07 00:45:28 -05:00 |
|
beder
|
5ec459c31d
|
Compiles/links assignment to string
|
2011-09-07 00:20:23 -05:00 |
|
beder
|
33a1d25c73
|
Value stuff compiles/links with lots of placeholder functions
|
2011-09-07 00:12:24 -05:00 |
|
beder
|
659e8207a0
|
Sketched more of the implementation
|
2011-09-06 23:11:38 -05:00 |
|