1. 17 Jul, 2012 1 commit
  2. 16 Jul, 2012 1 commit
  3. 13 Jul, 2012 2 commits
  4. 25 Apr, 2011 1 commit
  5. 23 Nov, 2010 1 commit
  6. 16 Nov, 2010 1 commit
  7. 04 Nov, 2010 1 commit
  8. 26 Aug, 2010 1 commit
  9. 19 Jul, 2010 5 commits
  10. 06 May, 2010 1 commit
  11. 05 May, 2010 1 commit
    • Vincent Povirk's avatar
      ole32: Store the location of all blocks in a big block chain in memory. · 42550953
      Vincent Povirk authored
      A big block chain is a linked list, and we pretty much need random
      access to them. This should theoretically make accessing a random
      point in the chain O(log2 n) instead of O(n) (with disk access scaling
      based on the size of the read/write, not its location). It
      theoretically takes O(n) memory based on the size, but it can do
      better if the chain isn't very fragmented (which I believe will
      generally be the case for long chains). It also involves fetching all
      the big block locations when we open the chain, but we already do that
      anyway (and it should be faster to read it all in one go than
      piecemeal).
      42550953
  12. 13 Apr, 2010 1 commit
  13. 22 Mar, 2010 2 commits
  14. 15 Mar, 2010 4 commits
  15. 16 Dec, 2009 1 commit
  16. 11 Dec, 2009 2 commits
  17. 10 Dec, 2009 1 commit
  18. 09 Dec, 2009 4 commits
  19. 08 Dec, 2009 3 commits
  20. 07 Dec, 2009 5 commits
  21. 04 Dec, 2009 1 commit