computedItems | anonymous_namespace{Registry.cpp}::CollectedItems | |
Find(const Identifier &name) -> Iterator | anonymous_namespace{Registry.cpp}::CollectedItems | inline |
InsertNewItemUsingHint(BaseItem *pItem, const OrderingHint &hint, size_t endItemsCount, bool force) -> bool | anonymous_namespace{Registry.cpp}::CollectedItems | |
InsertNewItemUsingPreferences(ItemOrdering &itemOrdering, BaseItem *pItem) -> bool | anonymous_namespace{Registry.cpp}::CollectedItems | |
items | anonymous_namespace{Registry.cpp}::CollectedItems | |
Iterator typedef | anonymous_namespace{Registry.cpp}::CollectedItems | |
MergeItems(ItemOrdering &itemOrdering, const GroupItemBase &toMerge, const OrderingHint &hint, void *pComputedItemContext) | anonymous_namespace{Registry.cpp}::CollectedItems | |
MergeItemsAscendingNamesPass(ItemOrdering &itemOrdering, NewItems &newItems, int iPass, size_t endItemsCount, bool force) | anonymous_namespace{Registry.cpp}::CollectedItems | |
MergeItemsDescendingNamesPass(ItemOrdering &itemOrdering, NewItems &newItems, int iPass, size_t endItemsCount, bool force) | anonymous_namespace{Registry.cpp}::CollectedItems | |
MergeLater(Item &found, const Identifier &name, GroupItemBase::Ordering ordering) -> GroupItemBase * | anonymous_namespace{Registry.cpp}::CollectedItems | |
MergeLikeNamedItems(ItemOrdering &itemOrdering, NewItems::const_iterator left, NewItems::const_iterator right, int iPass, size_t endItemsCount, bool force) | anonymous_namespace{Registry.cpp}::CollectedItems | |
MergeWithExistingItem(ItemOrdering &itemOrdering, BaseItem *pItem) | anonymous_namespace{Registry.cpp}::CollectedItems | |
NewItem typedef | anonymous_namespace{Registry.cpp}::CollectedItems | |
NewItems typedef | anonymous_namespace{Registry.cpp}::CollectedItems | |
SubordinateMultipleItems(Item &found, GroupItemBase &items) | anonymous_namespace{Registry.cpp}::CollectedItems | |
SubordinateSingleItem(Item &found, BaseItem *pItem) | anonymous_namespace{Registry.cpp}::CollectedItems | |