github.com/emirpasic/gods/trees/binaryheap.Heap.Comparator (field)

7 uses

	github.com/emirpasic/gods/trees/binaryheap (current package)
		binaryheap.go#L29: 	Comparator utils.Comparator
		binaryheap.go#L34: 	return &Heap{list: arraylist.New(), Comparator: comparator}
		binaryheap.go#L39: 	return &Heap{list: arraylist.New(), Comparator: utils.IntComparator}
		binaryheap.go#L44: 	return &Heap{list: arraylist.New(), Comparator: utils.StringComparator}
		binaryheap.go#L130: 		if rightIndex < size && heap.Comparator(leftValue, rightValue) > 0 {
		binaryheap.go#L135: 		if heap.Comparator(indexValue, smallerValue) > 0 {
		binaryheap.go#L152: 		if heap.Comparator(parentValue, indexValue) <= 0 {