18 Commits

Author	SHA1	Message	Date
beder	8185fa48f1	Implemented (untested) the value builder	2011-09-09 23:28:21 -05:00
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	255a392eb9	Switched operator[] access to node reference equality, not node equality	2011-09-09 02:39:36 -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	37cd3bd53c	Added half of the std::map conversion (we don't have reading from Values yet)	2011-09-08 02:10:04 -05:00
beder	c080478444	Added back the streamable conversions	2011-09-08 02:05:03 -05:00
beder	bb2eafc387	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	21fbb461c0	Added streamable conversions	2011-09-08 00:48:40 -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	2d75a631e2	Set up map searching by templated key	2011-09-07 03:21:24 -05:00
beder	7a3f425720	Reorganized so that we don't have cyclic include problems	2011-09-07 02:59:58 -05:00
beder	6fa53f9714	Implemented map access by already-existing node	2011-09-07 02:39:59 -05:00
beder	a07642f156	Started implementing node_data	2011-09-07 00:45:28 -05:00
beder	d6811c42a8	Merged from trunk	2011-09-06 01:10:27 -05:00
beder	f56d453050	Added api sketch	2011-09-04 19:50:08 -05:00