From 55f8e2c01fe4513d5e3de55f567c392b4a18ecc2 Mon Sep 17 00:00:00 2001 From: Mike Buland Date: Wed, 13 Mar 2013 05:03:59 +0000 Subject: Added bind/unbind to the Cache system. Fixed typo in docs of heap. --- src/stable/heap.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/stable/heap.h') 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 * objects enqueued must support less-than-comparison. Then every time an * item is dequeued it is always the least item in the heap. The heap * operates using a binary tree for storage, which allows most operations - * to be very fast. Enqueueing and dequeueing are both O(log(N)) operatoins + * to be very fast. Enqueueing and dequeueing are both O(log(N)) operations * whereas peeking is constant time. * * This heap implementation allows iterating, however please note that any -- cgit v1.2.3