github.com/emirpasic/gods/trees/binaryheap.Iterator.index (field)
12 uses
github.com/emirpasic/gods/trees/binaryheap (current package)
iterator.go#L16: index int
iterator.go#L21: return Iterator{heap: heap, index: -1}
iterator.go#L29: if iterator.index < iterator.heap.Size() {
iterator.go#L30: iterator.index++
iterator.go#L32: return iterator.heap.withinRange(iterator.index)
iterator.go#L39: if iterator.index >= 0 {
iterator.go#L40: iterator.index--
iterator.go#L42: return iterator.heap.withinRange(iterator.index)
iterator.go#L48: value, _ := iterator.heap.list.Get(iterator.index)
iterator.go#L55: return iterator.index
iterator.go#L61: iterator.index = -1
iterator.go#L67: iterator.index = iterator.heap.Size()
![]() |
The pages are generated with Golds v0.3.2-preview. (GOOS=darwin GOARCH=amd64) Golds is a Go 101 project developed by Tapir Liu. PR and bug reports are welcome and can be submitted to the issue list. Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |