1. 27 Dec, 2014 1 commit
  2. 17 Dec, 2014 1 commit
  3. 10 Jun, 2014 1 commit
    • treebuilder: use a map instead of vector to store the entries · 4d3f1f97
      Finding a filename in a vector means we need to resort it every time we
      want to read from it, which includes every time we want to write to it
      as well, as we want to find duplicate keys.
      
      A hash-map fits what we want to do much more accurately, as we do not
      care about sorting, but just the particular filename.
      
      We still keep removed entries around, as the interface let you assume
      they were going to be around until the treebuilder is cleared or freed,
      but in this case that involves an append to a vector in the filter case,
      which can now fail.
      
      The only time we care about sorting is when we write out the tree, so
      let's make that the only time we do any sorting.
      Carlos Martín Nieto committed
  4. 03 Jan, 2014 2 commits
  5. 12 Dec, 2013 1 commit
  6. 14 Nov, 2013 1 commit
  7. 20 Feb, 2013 1 commit
  8. 18 Nov, 2012 1 commit
  9. 21 Aug, 2012 1 commit
  10. 19 Jun, 2012 1 commit
  11. 18 Jun, 2012 1 commit
  12. 07 Jun, 2012 1 commit
  13. 03 Apr, 2012 2 commits
  14. 01 Apr, 2012 1 commit
  15. 30 Mar, 2012 2 commits