| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2021-04-05 | Fix loop detection in NNTree | Jay Berkenbilt | |
| 2021-02-23 | Spell check | Jay Berkenbilt | |
| 2021-01-26 | NNTree: rework iterators to be more memory efficient | Jay Berkenbilt | |
| 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 | name/number trees: remove | Jay Berkenbilt | |
| 2021-01-25 | name/number trees: insertAfter | Jay Berkenbilt | |
| 2021-01-25 | name/number trees: newEmpty, increment/decrement end() | Jay Berkenbilt | |
| 2021-01-25 | Implement repair and insert for name/number trees | Jay Berkenbilt | |
| 2021-01-24 | Add new constructors for name/number tree helpers | Jay Berkenbilt | |
| Add constructors that take a QPDF object so we can issue warnings and create new indirect objects. | |||
| 2021-01-24 | Reimplement name and number tree object helpers | Jay Berkenbilt | |
| 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. | |||
 |
index : qpdf | |
| qpdf + zopfli patch | Justin Gassner |
| aboutsummaryrefslogtreecommitdiffstats |