ORIGINAL
|
Implementation of set containers. More...
#include "allocator.h"
#include "couple.h"
#include "hash.h"
#include "hashTable.h"
#include "set.h"
#include "ownerPtr.h"
#include "comparator.h"
#include "RBTree.h"
#include "skipList.h"
Go to the source code of this file.
Classes | |
class | original::hashSet< TYPE, HASH, ALLOC > |
Hash table based implementation of the set interface. More... | |
class | original::hashSet< TYPE, HASH, ALLOC >::Iterator |
Forward iterator for hashSet. More... | |
class | original::treeSet< TYPE, Compare, ALLOC > |
Red-Black Tree based implementation of the set interface. More... | |
class | original::treeSet< TYPE, Compare, ALLOC >::Iterator |
Bidirectional iterator for treeSet. More... | |
class | original::JSet< TYPE, Compare, ALLOC > |
Skip List based implementation of the set interface. More... | |
class | original::JSet< TYPE, Compare, ALLOC >::Iterator |
Forward iterator for JSet. More... | |
Namespaces | |
namespace | original |
Main namespace for the project Original. | |
Implementation of set containers.
Provides three set implementations with different underlying data structures:
Common Features:
Performance Characteristics:
Container | Insertion | Lookup | Deletion | Ordered | Memory Usage |
---|---|---|---|---|---|
hashSet | O(1) avg | O(1) | O(1) | No | Medium-High |
treeSet | O(log n) | O(log n) | O(log n) | Yes | Low |
JSet | O(log n) avg | O(log n) | O(log n) | Yes | Medium |
Usage Guidelines: