Collections

Collection classes. More...

Classes
class	utl::Array
	SortedCollection that stores objects in an array. More...
class	utl::ArrayIt
	Random-access Array iterator. More...
class	utl::BinaryData
	Vector of bytes. More...
class	utl::BinTree
	Binary tree abstraction. More...
class	utl::BinTreeBfsIt
	Breadth-first BinTree iterator. More...
class	utl::BinTreeIt
	In-order bi-directional BinTree iterator. More...
class	utl::BinTreeNode
	Binary tree node. More...
class	utl::BitArray
	Array of n-bit values. More...
class	utl::BitArrayElem
	Reference to a value stored in a BitArray. More...
class	utl::Collection
	A collection of objects. More...
class	utl::ConcurrentQueue< T >
	Thread-safe queue structure. More...
class	utl::ConcurrentQueue_mutex< T >
	utl::ConcurrentQueue that uses mutexes for the producer & consumer locks. More...
class	utl::Deque
	A sequence of objects permitting efficient insertion and removal at either end. More...
class	utl::DequeIt
	Deque iterator. More...
class	utl::ExtArray
	Externally stored array of objects. More...
class	utl::Hashtable
	Chained hashing collection. More...
class	utl::HashtableIt
	Bi-directional Hashtable iterator. More...
class	utl::Heap
	Heap data structure. More...
class	utl::HeapIt
	Bi-directional Heap iterator. More...
class	utl::List
	Doubly-linked list. More...
class	utl::ListIt
	Bi-directional List iterator. More...
class	utl::ListNode
	List node. More...
class	utl::CachedObject
	Cached object. More...
class	utl::ObjectCache
	LRU object cache. More...
class	utl::ObjectRegistry
	Object registry. More...
class	utl::PriorityQueue< T >
	Priority queue. More...
class	utl::Queue< T >
	FIFO (first-in, first-out) data structure. More...
class	utl::RBtree
	Red/black tree. More...
class	utl::RBtreeNode
	Red/black tree node. More...
class	utl::RingBuffer< T, nullValue >
	Thread-safe fixed-size queue. More...
class	utl::SkipList
	Skip list. More...
class	utl::SkipListIt
	Bi-directional SkipList iterator. More...
class	utl::SkipListNode
	SkipList node. More...
class	utl::SlistNode
	Singly-linked list node. More...
class	utl::SortedCollection
	Abstraction for a Collection whose objects may be sorted. More...
class	utl::Stack< T >
	LIFO (last-in, first-out) data structure. More...
class	utl::StringVars
	A set of (variable-name, variable-value) tuples. More...
class	utl::TArray< T >
	Template version of Array. More...
class	utl::TCollection< T >
	Templated proxy for Collection. More...
class	utl::TDeque< T >
	Template version of Deque. More...
class	utl::TDequeIt< T >
	Template version of DequeIt. More...
class	utl::THashtable< T >
	Template version of Hashtable. More...
class	utl::THashtableIt< T >
	Template version of HashtableIt. More...
class	utl::THeap< T >
	Template version of Heap. More...
class	utl::THeapIt< T >
	Template version of HeapIt. More...
class	utl::TList< T >
	Template version of List. More...
class	utl::TListIt< T >
	Template version of ListIt. More...
class	utl::TRBtree< T >
	Template version of RBtree. More...
class	utl::TRBtreeIt< T >
	Template version of RBtreeIt. More...
class	utl::TSkipList< T >
	Template version of SkipList. More...
class	utl::TSkipListIt< T >
	Template version of SkipListIt. More...
class	utl::TSortedCollection< T >
	Templated proxy for SortedCollection. More...
class	utl::Vector< T >
	A sequence of same-type objects. More...
class	utl::VectorMD< T >
	Abstract base for n-dimensional vectors. More...
class	utl::Vector1d< T >
	One-dimensional vector. More...
class	utl::Vector2d< T >
	Two-dimensional vector. More...
class	utl::Vector3d< T >
	Three-dimensional vector. More...

Enumerations
enum	utl::cache_t { utl::cache_write_thru, utl::cache_write_back }
	Cache write policy. More...

Detailed Description

Collection classes.

Enumeration Type Documentation

cache_t

enum utl::cache_t

Cache write policy.

Enumerator
cache_write_thru	write-thru (safest)
cache_write_back	write-back (best performance)

Definition at line 18 of file ObjectCache.h.