Changeset 5416 for trunk/tango/util/container/SortedMap.d

Timestamp:

03/21/10 14:15:40 (2 years ago)

Author:

kris

Message:

made the default allocator faster, and hid the implementation from the containers. Use the new cache() method instead for configuring how containers pre-allocate.

Files:

• trunk/tango/util/container/SortedMap.d (modified) (3 diffs)

trunk/tango/util/container/SortedMap.d

@@ -128 +128 @@
-        /***********************************************************************
-
-                Return the configured allocator
-                
-        ***********************************************************************/
-
-        final Alloc allocator ()
-        {
-                return heap;
-        }
-
-        /***********************************************************************
-
-                Return a generic iterator for contained elements
-                
@@ -169 +158 @@
-                i.node = count ? tree.findFirst(key, cmp, forward) : null;
-                return i;
+        }
+
+        /***********************************************************************
+
+                Configure the assigned allocator with the size of each
+                allocation block (number of nodes allocated at one time)
+                and the number of nodes to pre-populate the cache with.
+                
+                Time complexity: O(n)
+
+        ***********************************************************************/
+
+        final SortedMap cache (size_t chunk, size_t count=0)
+        {
+                heap.config (chunk, count);
+                return this;
-        }
-
@@ -1076 +1081 @@
-                // use a chunk allocator, and presize the bucket[]
-                auto test = new SortedMap!(int, int, Container.reap, Container.Chunk);
-allocator.config (1000, 5
+cache (1000, 500_0
-                const count = 500_000;
-                StopWatch w;