Lines Matching full:heap

57 		 * Heap algorithms like everything numbered from 1, so  in camq_init()
99 	 * Heap algorithms like everything numbered from 1, so  in camq_resize()
100 	 * remember that our pointer into the heap array is offset  in camq_resize()
115  * the Heap(1, num_elements) property and array_size - num_elements >= 1,
116  * output Heap(1, num_elements+1) including new_entry in the array.
134  * Heap(1, num_elements) property and an index such that 1 <= index <=
135  * num_elements, remove that entry and restore the Heap(1, num_elements-1)
161  * Heap(1, num_entries) property, an index such that 1 <= index <= num_elements,
163  * element index and restore the Heap(0, num_elements) property.
289  * Heap routines for manipulating CAM queues.
325  * Heap(1, new_index-1) property and a new element in location
326  * new_index, output Heap(1, new_index).
347  * Heap(index + 1, num_entries) property with index containing
348  * an unsorted entry, output Heap(index, num_entries).