65 for( node = dict->head.next; node != &dict->head; node = next ) {
79 }
while( node->key !=
NULL && ! (*dict->leq)(dict->frame, node->key, key));
97 node->next->prev = node->prev;
98 node->prev->next = node->next;
109 }
while( node->key !=
NULL && ! (*dict->leq)(dict->frame, key, node->key));
ROOT::Detail::TRangeCast< T, true > TRangeDynCast
TRangeDynCast is an adapter class that allows the typed iteration through a TCollection.
#define dictDeleteDict(dict)
#define dictSearch(dict, key)
#define dictDelete(dict, node)
#define dictInsertBefore(dict, node, key)
#define dictNewDict(frame, leq)