diff options
author | Mike Buland <eichlan@xagasoft.com> | 2013-03-13 05:03:59 +0000 |
---|---|---|
committer | Mike Buland <eichlan@xagasoft.com> | 2013-03-13 05:03:59 +0000 |
commit | 55f8e2c01fe4513d5e3de55f567c392b4a18ecc2 (patch) | |
tree | 0e515f65ff43fbebe396516e79cb5f6b96759e73 /src/stable | |
parent | 0ac226c809b6495d5dbc09c2f847638e10aca315 (diff) | |
download | libbu++-55f8e2c01fe4513d5e3de55f567c392b4a18ecc2.tar.gz libbu++-55f8e2c01fe4513d5e3de55f567c392b4a18ecc2.tar.bz2 libbu++-55f8e2c01fe4513d5e3de55f567c392b4a18ecc2.tar.xz libbu++-55f8e2c01fe4513d5e3de55f567c392b4a18ecc2.zip |
Added bind/unbind to the Cache system. Fixed typo in docs of heap.
Diffstat (limited to 'src/stable')
-rw-r--r-- | src/stable/heap.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/stable/heap.h b/src/stable/heap.h index 2fcd387..d197b91 100644 --- a/src/stable/heap.h +++ b/src/stable/heap.h | |||
@@ -191,7 +191,7 @@ namespace Bu | |||
191 | * objects enqueued must support less-than-comparison. Then every time an | 191 | * objects enqueued must support less-than-comparison. Then every time an |
192 | * item is dequeued it is always the least item in the heap. The heap | 192 | * item is dequeued it is always the least item in the heap. The heap |
193 | * operates using a binary tree for storage, which allows most operations | 193 | * operates using a binary tree for storage, which allows most operations |
194 | * to be very fast. Enqueueing and dequeueing are both O(log(N)) operatoins | 194 | * to be very fast. Enqueueing and dequeueing are both O(log(N)) operations |
195 | * whereas peeking is constant time. | 195 | * whereas peeking is constant time. |
196 | * | 196 | * |
197 | * This heap implementation allows iterating, however please note that any | 197 | * This heap implementation allows iterating, however please note that any |