From 4bbea0550446d05416a2d638bd200f0b0c2ea984 Mon Sep 17 00:00:00 2001
From: David Williams <david@david-williams.info>
Date: Sun, 13 Feb 2011 00:15:32 +0000
Subject: [PATCH] Documentation and tidying.

---
 library/PolyVoxCore/include/Volume.inl | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/library/PolyVoxCore/include/Volume.inl b/library/PolyVoxCore/include/Volume.inl
index f257c350..fd48aab6 100644
--- a/library/PolyVoxCore/include/Volume.inl
+++ b/library/PolyVoxCore/include/Volume.inl
@@ -393,8 +393,10 @@ namespace PolyVox
 			return block;
 		}
 
+		//Currently we find the oldest block by iterating over the whole array. Of course we could store the blocks sorted by
+		//timestamp (set, priority_queue, etc) but then we'll need to move them around as the timestamp changes. Can come back 
+		//to this if it proves to be a bottleneck (compraed to the cost of actually doing the compression/decompression).
 		uint32_t uUncompressedBlockIndex = 100000000;
-
 		assert(m_vecUncompressedBlockCache.size() <= m_uMaxUncompressedBlockCacheSize);
 		if(m_vecUncompressedBlockCache.size() == m_uMaxUncompressedBlockCacheSize)
 		{