9 Commits

Author	SHA1	Message	Date
Jay Berkenbilt	ec48820c3c	Fix loop detection in NNTree	2021-04-05 07:59:02 -04:00
Jay Berkenbilt	1886673d7e	Spell check	2021-02-23 10:38:05 -05:00
Jay Berkenbilt	8ed3e8c79b	NNTree: rework iterators to be more memory efficient ... Keep a std::pair internal to the iterators so that operator* can return a reference and operator-> can work, and each can work without copying pairs of objects around.	2021-01-26 09:12:23 -05:00
Jay Berkenbilt	e7e20772ed	name/number trees: remove	2021-01-26 09:12:23 -05:00
Jay Berkenbilt	5816fb44b8	name/number trees: insertAfter	2021-01-25 15:39:10 -05:00
Jay Berkenbilt	16a9bb3f6f	name/number trees: newEmpty, increment/decrement end()	2021-01-25 15:39:10 -05:00
Jay Berkenbilt	b5614f611d	Implement repair and insert for name/number trees	2021-01-24 19:31:45 -05:00
Jay Berkenbilt	d61ffb65d0	Add new constructors for name/number tree helpers ... Add constructors that take a QPDF object so we can issue warnings and create new indirect objects.	2021-01-24 03:27:26 -05:00
Jay Berkenbilt	4a1cce0a47	Reimplement name and number tree object helpers ... Create a computationally and memory efficient implementation of name and number trees that does binary searches as intended by the data structure rather than loading into a map, which can use a great deal of memory and can be very slow.	2021-01-24 03:22:51 -05:00