Creates a heap from a vector and a custom comparator function. # Parameters - `items`: A vector of items to be turned into a heap. - `comparator`: A function that defines the heap's ordering. # Returns A `Heap` instance with the elements from the provided vector.
(items: Vec<T>, comparator: fn(&T, &T) -> bool)
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected