1. 23 Nov, 2010 1 commit
  2. 16 Nov, 2010 1 commit
  3. 04 Nov, 2010 1 commit
  4. 26 Aug, 2010 1 commit
  5. 19 Jul, 2010 5 commits
  6. 06 May, 2010 1 commit
  7. 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
  8. 13 Apr, 2010 1 commit
  9. 22 Mar, 2010 2 commits
  10. 15 Mar, 2010 4 commits
  11. 16 Dec, 2009 1 commit
  12. 11 Dec, 2009 2 commits
  13. 10 Dec, 2009 1 commit
  14. 09 Dec, 2009 4 commits
  15. 08 Dec, 2009 3 commits
  16. 07 Dec, 2009 5 commits
  17. 04 Dec, 2009 3 commits
  18. 24 Nov, 2009 1 commit
  19. 20 Nov, 2009 1 commit
  20. 18 Nov, 2009 1 commit