1. 20 Jun, 2014 1 commit
  2. 14 Apr, 2014 1 commit
  3. 04 Apr, 2014 1 commit
    • Jan Kadlec's avatar
      new_node: Do not reuse old pointers in zone copy. · 63384e60
      Jan Kadlec authored
       - node->new_node is thus obosolete.
       - since hattrie_dup made almost a full copy anyway, it's feasible to
         let the zone contents recreate the zone anew, with proper pointers.
      (new node was used to set only parent pointer, others were reset anyway
      in adjusting, all this will die in the new zone API, but at least like
      this it's easier to maintain.)
      63384e60
  4. 02 Apr, 2014 1 commit
    • Marek Vavruša's avatar
      hat-trie: growable hash size · e4a47115
      Marek Vavruša authored
      Leaf hhash node size is growable (1-4 pages).
      The rule is simple, when a hashtable is split the left and right
      children size is clamped left and right weight to the nearest
      hhash size. The sizes are chosen arbitrarily so the table size
      is always a multiple of page size.
      e4a47115
  5. 11 Mar, 2014 1 commit
  6. 28 Feb, 2014 3 commits
  7. 13 Jan, 2014 1 commit
  8. 09 Jan, 2014 1 commit
  9. 19 Dec, 2013 1 commit
  10. 28 Nov, 2013 1 commit
    • Marek Vavrusa's avatar
      Fixed hattrie node split with new hashtable. · fcf7f2c8
      Marek Vavrusa authored
      Since inserting into hashtable may fail, this would result in lost
      records. I refactored the code a bit and hashtable node split is now
      done recursively, i.e. it divides nodes until it fits.
      fcf7f2c8
  11. 27 Nov, 2013 1 commit
  12. 31 Oct, 2013 1 commit
  13. 29 Oct, 2013 1 commit
  14. 24 Oct, 2013 1 commit
  15. 17 Oct, 2013 1 commit
  16. 16 Oct, 2013 1 commit
  17. 11 Oct, 2013 1 commit
  18. 26 Jun, 2013 1 commit
  19. 29 May, 2013 1 commit
  20. 15 May, 2013 1 commit
  21. 10 May, 2013 2 commits
  22. 02 May, 2013 1 commit
    • Marek Vavrusa's avatar
      Implemented HAT trie longest prefix match + tests. · 8d1f0569
      Marek Vavrusa authored
      General idea is regular search with keeping node stack.
      If node is found, then return current node.
      If node is htable, search for suffixes in htable.
      If anything fails, walk up the visited nodes and check if
      any visited node has value. If yes, then it is a prefix.
      
      f.e. searching for 'abcd'
      visited nodes: root -a-> {1:trie} -b-> {2:htable}
      1. search htable for 'cd', 'c'
      2. retrace to node {1}, does it have value?
      3. yes, node1 is prefix 'ab' for 'abcd'
      
      Change-Id: I622adbe9a127d8317b933af4bf56e1411e2d915f
      8d1f0569
  23. 26 Apr, 2013 1 commit
  24. 10 Apr, 2013 1 commit
  25. 24 Mar, 2013 1 commit
  26. 18 Feb, 2013 4 commits
  27. 13 Feb, 2013 2 commits
  28. 12 Dec, 2012 2 commits