Lines Matching defs:Interface
6 // heap.Interface. A heap is a tree with the property that each node is the
12 // queue, implement the Heap interface with the (negative) priority as the
21 // Any type that implements heap.Interface may be used as a
27 // Note that Push and Pop in this interface are for package heap's
30 type Interface interface {
31 sort.Interface
32 Push(x interface{}) // add x as element Len()
33 Pop() interface{} // remove and return element Len() - 1.
41 func Init(h Interface) {
52 func Push(h Interface, x interface{}) {
61 func Pop(h Interface) interface{} {
71 func Remove(h Interface, i int) interface{} {
85 func Fix(h Interface, i int) {
91 func up(h Interface, j int) {
102 func down(h Interface, i0, n int) bool {
