CFBinaryHeap
Declaration
class CFBinaryHeapOverview
CFBinaryHeap implements a container that stores values sorted using a binary search algorithm. All binary heaps are mutable; there is not a separate immutable variety. Binary heaps can be useful as priority queues.
Topics
CFBinaryHeap Miscellaneous Functions
CFBinaryHeapAddValue(_:_:)CFBinaryHeapApplyFunction(_:_:_:)CFBinaryHeapContainsValue(_:_:)CFBinaryHeapCreate(_:_:_:_:)CFBinaryHeapCreateCopy(_:_:_:)CFBinaryHeapGetCount(_:)CFBinaryHeapGetCountOfValue(_:_:)CFBinaryHeapGetMinimum(_:)CFBinaryHeapGetMinimumIfPresent(_:_:)CFBinaryHeapGetTypeID()CFBinaryHeapGetValues(_:_:)CFBinaryHeapRemoveAllValues(_:)CFBinaryHeapRemoveMinimumValue(_:)
Callbacks
Data Types
Constants
See Also
Related Documentation
- Collections Programming Topics