| commit | c86726c8aed20e207a88a5ba29ee0bae83b14751 | |
| author | strange <kawk256@gmail.com> | |
| Sun, 7 Feb 2010 19:39:13 +0000 (7 12:39 -0700) | ||
| committer | strange <kawk256@gmail.com> | |
| Sun, 7 Feb 2010 19:39:13 +0000 (7 12:39 -0700) | ||
| tree | 2b6e3a39437000dde1a8d447f7ebd7d1e13820d9 | treesnapshot (tar.gz zip) |
| parent | f41f57a6dddbc04c53a1ddaff961b8b1175da7b1 | commitdiff |
The current tree-style design is, hmm . . . not optimal.
Quoting from the Wikipedia article for Quadtrees, "quadtrees are useful for
[storing sparse data]". I can't imagine what is more sparse than block
allocation data . . . perhaps a one-dimensional quadtree would work quite
well?
Quoting from the Wikipedia article for Quadtrees, "quadtrees are useful for
[storing sparse data]". I can't imagine what is more sparse than block
allocation data . . . perhaps a one-dimensional quadtree would work quite
well?
| gui/src/storage/AllocEvent.cpp | [new file with mode: 0644] | blob |
| gui/src/storage/AllocEvent.h | [new file with mode: 0644] | blob |
| gui/src/storage/BlockTreeNode.cpp | diffblobblamehistory | |
| gui/src/storage/BlockTreeNode.h | diffblobblamehistory | |
| gui/src/storage/Event.cpp | diffblobblamehistory | |
| gui/src/storage/Event.h | diffblobblamehistory | |
| gui/src/storage/FreeEvent.cpp | [new file with mode: 0644] | blob |
| gui/src/storage/FreeEvent.h | [new file with mode: 0644] | blob |
| gui/src/storage/Snapshot.h | diffblobblamehistory | |
| gui/src/storage/StorageFactory.cpp | diffblobblamehistory |