Logo white

OpenSystemsDevelopment / qpdf

Sign in
  • Sign in
  • Project
  • Files
  • Commits
  • Network
  • Graphs
  • Milestones
  • Issues 0
  • Merge Requests 0
  • Labels
  • Wiki
  • Commits 4,691
  • Compare
  • Branches 1
  • Tags 0
  • qpdf
  • libqpdf
  • NNTree.cc
05 Apr, 2021
1 commit
  • Fix loop detection in NNTree
    ec48820c
    Jay Berkenbilt authored
    2021-04-05 07:59:02 -0400  
    Browse File »

23 Feb, 2021
1 commit
  • Spell check
    1886673d
    Jay Berkenbilt authored
    2021-02-23 10:38:05 -0500  
    Browse File »

26 Jan, 2021
2 commits
  • NNTree: rework iterators to be more memory efficient ...
    8ed3e8c7
    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.
    Jay Berkenbilt authored
    2021-01-26 09:12:23 -0500  
    Browse File »
  • name/number trees: remove
    e7e20772
    Jay Berkenbilt authored
    2021-01-26 09:12:23 -0500  
    Browse File »

25 Jan, 2021
2 commits
  • name/number trees: insertAfter
    5816fb44
    Jay Berkenbilt authored
    2021-01-25 15:39:10 -0500  
    Browse File »
  • name/number trees: newEmpty, increment/decrement end()
    16a9bb3f
    Jay Berkenbilt authored
    2021-01-25 15:39:10 -0500  
    Browse File »

24 Jan, 2021
3 commits
  • Implement repair and insert for name/number trees
    b5614f61
    Jay Berkenbilt authored
    2021-01-24 19:31:45 -0500  
    Browse File »
  • Add new constructors for name/number tree helpers ...
    d61ffb65
    Add constructors that take a QPDF object so we can issue warnings and
    create new indirect objects.
    Jay Berkenbilt authored
    2021-01-24 03:27:26 -0500  
    Browse File »
  • Reimplement name and number tree object helpers ...
    4a1cce0a
    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.
    Jay Berkenbilt authored
    2021-01-24 03:22:51 -0500  
    Browse File »