UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC > Member List

This is the complete list of members for UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >, including all inherited members.

_add(const InternalKeyT *key, InternalItemT *item=NULL, UT_IndexedHashMapItemId *id=NULL)	UT_IndexedHashMap	protected
_addReference(UT_IndexedHashMapItemId id, int inc)	UT_IndexedHashMap	protected
_addReference(UT_IndexedHashMapItemId id)	UT_IndexedHashMap	inlineprotected
_extractItems(UT_Array< UT_IndexedHashMapItemId > &ids, UT_Array< InternalItemT * > &items, exint maxitems) const	UT_IndexedHashMap	protected
_extractItems(UT_Array< UT_IndexedHashMapItemId > &ids, UT_Array< InternalItemT * > &items) const	UT_IndexedHashMap	protected
_extractItems(UT_Array< InternalItemT * > &items) const	UT_IndexedHashMap	protected
_find(const InternalKeyT *key) const	UT_IndexedHashMap	inlineprotected
_findId(const InternalKeyT *key) const	UT_IndexedHashMap	inlineprotected
_findItemAndId(const InternalKeyT *key, UT_IndexedHashMapItemId &id) const	UT_IndexedHashMap	protected
_get(UT_IndexedHashMapItemId id) const	UT_IndexedHashMap	protected
_getKey(UT_IndexedHashMapItemId id) const	UT_IndexedHashMap	protected
_getOrderedItem(exint index, UT_IndexedHashMapItemId *id) const	UT_IndexedHashMap	protected
_remove(const InternalKeyT *key)	UT_IndexedHashMap	protected
_remove(UT_IndexedHashMapItemId id)	UT_IndexedHashMap	protected
_replace(const UT_IndexedHashMap &src)	UT_IndexedHashMap	protected
_replaceItem(UT_IndexedHashMapItemId id, const InternalKeyT *key, InternalItemT *new_item=NULL)	UT_IndexedHashMap	protected
add(const KEY &key, ITEM *item=NULL, UT_IndexedHashMapItemId *id=NULL)	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
addReference(UT_IndexedHashMapItemId id, int inc)	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
addReference(UT_IndexedHashMapItemId id)	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
areKeysEqual(const InternalKeyT *k1, const InternalKeyT *k2) const override	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotectedvirtual
begin() const	UT_IndexedHashMap	inline
beginList() const	UT_IndexedHashMap	inline
castITEM(InternalItemT *item) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotected
castITEM(const InternalItemT *item) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotected
castKEY(InternalKeyT *key) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotected
castKEY(const InternalKeyT *key) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotected
clear()	UT_IndexedHashMap
compactIds(IdRemapping &remapping)	UT_IndexedHashMap
copyKey(const InternalKeyT *key) const override	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotectedvirtual
deleteItem(InternalItemT *item) const override	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotectedvirtual
deleteKey(InternalKeyT *key) const override	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotectedvirtual
empty() const	UT_IndexedHashMap	inline
end() const	UT_IndexedHashMap	inline
endList() const	UT_IndexedHashMap	inline
entries() const	UT_IndexedHashMap	inline
extractItems(UT_Array< UT_IndexedHashMapItemId > &ids, UT_Array< ITEM * > &items) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
extractItems(UT_Array< UT_IndexedHashMapItemId > &ids, UT_Array< ITEM * > &items, exint maxitems) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
extractItems(UT_Array< ITEM * > &items) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
find(const KEY &key) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
find(const KEY &key, UT_IndexedHashMapItemId &id) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
findId(const KEY &key) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
get(UT_IndexedHashMapItemId id) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
getItemIdUpperBound() const	UT_IndexedHashMap	inline
getKey(UT_IndexedHashMapItemId id) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
getMemoryUsage(bool inclusive) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
getOccupancy() const	UT_IndexedHashMap	inline
getOrderedItem(exint index, UT_IndexedHashMapItemId *id=NULL) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
getReferenceCount(UT_IndexedHashMapItemId id) const	UT_IndexedHashMap
hash(const InternalKeyT *key) const override	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotectedvirtual
InternalItemT typedef	UT_IndexedHashMap
InternalKeyT typedef	UT_IndexedHashMap
isItemLessThan(const InternalItemT *a, const InternalItemT *b) const override	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotectedvirtual
newItem(const InternalKeyT *key) const override	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inlineprotectedvirtual
operator()(UT_IndexedHashMapItemId id) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
operator()(const KEY &k) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
operator[](UT_IndexedHashMapItemId id) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
operator[](const KEY &k) const	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
remove(const KEY &key)	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
remove(UT_IndexedHashMapItemId id)	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
replace(const UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC > &src)	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
replaceItem(UT_IndexedHashMapItemId id, const KEY &key, ITEM *item=NULL)	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
replaceItem(const KEY &old_key, const KEY &new_key)	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
sortItems()	UT_IndexedHashMap
UT_IndexedHashMap(bool store_ids)	UT_IndexedHashMap
UT_IndexedHashMapHoleQueue typedef	UT_IndexedHashMap	protected
UT_IndexedHashMapT(bool store_ids=true)	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline
UT_IndexedHashMapTable typedef	UT_IndexedHashMap	protected
UT_IndexedHashMapVector typedef	UT_IndexedHashMap	protected
~UT_IndexedHashMap()	UT_IndexedHashMap	virtual
~UT_IndexedHashMapT() override	UT_IndexedHashMapT< KEY, ITEM, DEFER_ALLOC >	inline