Roma&Weiss'sCode  1.0
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12]
 NcgcUtilNamespace for avoiding conflict with std::
 Citerator_traitsRelated type of an iterator
 Citerator_traits< T * >Specialization for pointers
 C_screenPoint2D point in screen coordinates
 C_worldPoint2D point in world coordinates
 CAATreeAATree class interface
 CAbsBstSearchTree abstract class interface
 CAbsHTableHashTable abstract class interface
 CAbsPrQueueAbstract class for priority queues
 CAbsQueueQueue abstract class interface
 CAbsStackStack abstract class interface
 CAVLTreeAVLTree class interface
 CBinaryHeapBinaryHeap class interface
 CBinNodeNode class for a binary tree
 Ccompare_pairCompares the keys of two pairs
 Ccompare_toCompares the keys of two objects
 Ceqstr
 Ceqt_toCompares the keys of two objects
 ChashElement
 CHashTableHashTable class interface
 CHashEntryHolds the structure of an entry into the hash table
 Chtest
 CInOrderInOrder class interface; maintains "current position"
 CLevelOrderLevelOrder class interface; maintains "current position"
 Cltstr
 Cltstr_pair
 Cmy_hash
 COrderedSearchTreeFoward declaration of external OrderedSearchTree class
 CPostOrderPostOrder class interface; maintains "current position"
 CPreOrderPreOrder class interface; maintains "current position"
 Cprint
 CQueueQueue class interface: linked list implementation
 CQueueNodeStructure of a node of the queue
 CRandomRandom class interface
 CRedBlackTreeFoward declaration of external RedBlackTree class
 CSearchTreeFoward declaration of external SerachTree class
 CSplayTreeFoward declaration of external RedBlackTree class
 CStackStack class interface: linked list implementation
 CStackNodeHold the structure of a node into the stack
 CStNodeHolds the data necessary for stacking a node
 Cteste
 CTreeIteratorTreeIterator class interface; maintains "current position"
 CTreeNodeA silly class for testing the tree system
 Cutl_insert_iteratorInsert iterator
 Cutl_istream_IteratorInput stream iterator
 Cutl_ostream_iteratorOutput stream iterator
 Cutl_reverse_iteratorA simpler implementation of STL reverse_iterator class
 CutlAllocatorForward declaration of utlAllocator
 CrebindIn effect: typedef utlAllocator<U> other
 CutlAllocator< void >Ultra-simplified specialization of utlAllocator
 CrebindTemplate constructor
 CutlBitSetA simpler implementation of STL class bitset
 CreferenceProxy class that acts as a reference to a single bit
 CutlBitSetLightAn implementation of bitset using long int or unsigned long int (maximum of 32 bits or 64 bits in 64-bit OSs)
 CreferenceProxy class that acts as a reference to a single bit
 CutlDequeA simpler implementation of STL class deque
 Cconst_iteratorConstant iterator for deques
 CiteratorIterator for deques
 CutlFilePtrHandles file related operations
 CutlHashFunForward declaration of utlHashFun
 CutlHashMapForward declaration of utlHashMap
 Cconst_iteratorConst_iterator for hash_maps
 CiteratorIterator for hash_maps
 CutlHashMultiMapForward declaration of utlHashMultiMap
 CutlHeapA non-standard implementation of a heap
 CutlIteratorBaseBase iterator
 Cbidirectional_iterator_tagBidirectional iterator category
 Cforward_iterator_tagForward iterator category
 Cinput_iterator_tagInput iterator category
 Coutput_iterator_tagOutput iterator category
 Crandom_access_iterator_tagRandom access iterator category
 CutlListA simpler implementation of STL class list
 Cconst_iteratorConstant iterator for lists
 CiteratorIterator for lists
 CListNodeStructure of a list node
 CutlMapMap for sorted dictionaries
 Cconst_iteratorConst_iterator for map
 CiteratorIterator for map
 Cvalue_compareFunction object that compares two values for ordering
 CutlMultiMapForward declaration of utlMultiMap
 CutlMultiSetForward declaration of utlMultiSet
 CutlPairSTL compatible pair
 CutlPriority_queueA simpler implementation of STL class priority_queue
 CutlQueueA simpler implementation of STL class queue
 CutlSetSet for sorted sets
 Cconst_iteratorConst_iterator for set
 CutlSorterImplements several algorithms for sorting arrays
 CutlStackA simpler implementation of STL class stack
 CutlStringA simpler implementation of STL class string
 CutlSwapByteThese routines are necessary for reversing the byte order of binary data for binary portability between big-endian and little-endian machines
 CutlVectorA simpler implementation of STL class vector
 Cconst_iteratorConstant iterator for vectors
 CiteratorIterator for vectors