eson
368447c31d
new file: LICENSE new file: README.md new file: compare/compare.go new file: for_test.go new file: heap/heap.go new file: heap/heap_test.go new file: interface.go new file: lastack/lastack.go new file: lastack/lastack_test.go new file: list/list.go new file: list/list_test.go new file: map/hashmap/hashmap.go new file: map/hashmap/hashmap_test.go new file: priority_list/iterator.go new file: priority_list/priority_list.go new file: priority_list/priority_list_test.go new file: priority_queue/iterator.go new file: priority_queue/priority_queue.go new file: priority_queue/priority_queue_test.go new file: priority_queue/vbt.go new file: priority_queue/vbt_test.go new file: priority_queuekey/iterator.go new file: priority_queuekey/priority_queuekey.go new file: priority_queuekey/priority_queuekey_test.go new file: priority_queuekey/vbt.go new file: priority_queuekey/vbt_test.go new file: set/hashset/hashset.go new file: set/hashset/hashset_test.go new file: set/treeset/treeset.go new file: set/treeset/treeset_test.go new file: sparse_array/array2/array2.go new file: sparse_array/array2/array2_test.go new file: sparse_array/array3/array3.go new file: sparse_array/array3/array3_test.go new file: sparse_array/arrayn/arrayn.go new file: sparse_array/arrayn/arrayn_test.go new file: stack/stack.go new file: stack/stack_test.go new file: tree/avl/avl.go new file: tree/avl/avl_test.go new file: tree/avl/iterator.go new file: tree/avldup/avldup.go new file: tree/avldup/avldup_test.go new file: tree/avldup/iterator.go new file: tree/avlkey/avlkey.go new file: tree/avlkey/avlkey_test.go new file: tree/avlkey/iterator.go new file: tree/avlkeydup/avlkeydup.go new file: tree/avlkeydup/avlkeydup_test.go new file: tree/avlkeydup/iterator.go new file: tree/vbt/iterator.go new file: tree/vbt/vbt.go new file: tree/vbt/vbt_test.go new file: tree/vbtkey/iterator.go new file: tree/vbtkey/vbtkey.go new file: tree/vbtkey/vbtkey_test.go
88 lines
1.4 KiB
Go
88 lines
1.4 KiB
Go
package plist
|
|
|
|
type Iterator struct {
|
|
pl *PriorityList
|
|
cur *Node
|
|
}
|
|
|
|
func (iter *Iterator) Value() interface{} {
|
|
return iter.cur.value
|
|
}
|
|
|
|
func (iter *Iterator) Prev() bool {
|
|
if iter.cur == iter.pl.head {
|
|
return false
|
|
}
|
|
iter.cur = iter.cur.prev
|
|
return iter.cur != iter.pl.head
|
|
}
|
|
|
|
func (iter *Iterator) Next() bool {
|
|
if iter.cur == iter.pl.tail {
|
|
return false
|
|
}
|
|
iter.cur = iter.cur.next
|
|
return iter.cur != iter.pl.tail
|
|
}
|
|
|
|
func (iter *Iterator) MoveToHead() {
|
|
iter.cur = iter.pl.head
|
|
}
|
|
|
|
func (iter *Iterator) MoveToTail() {
|
|
iter.cur = iter.pl.tail
|
|
}
|
|
|
|
type CircularIterator struct {
|
|
pl *PriorityList
|
|
cur *Node
|
|
}
|
|
|
|
func (iter *CircularIterator) Value() interface{} {
|
|
return iter.cur.value
|
|
}
|
|
|
|
func (iter *CircularIterator) Prev() bool {
|
|
if iter.pl.size == 0 {
|
|
return false
|
|
}
|
|
|
|
if iter.cur == iter.pl.head {
|
|
iter.cur = iter.pl.tail.prev
|
|
return true
|
|
}
|
|
|
|
iter.cur = iter.cur.prev
|
|
if iter.cur == iter.pl.head {
|
|
iter.cur = iter.pl.tail.prev
|
|
}
|
|
|
|
return true
|
|
}
|
|
|
|
func (iter *CircularIterator) Next() bool {
|
|
if iter.pl.size == 0 {
|
|
return false
|
|
}
|
|
|
|
if iter.cur == iter.pl.tail {
|
|
iter.cur = iter.pl.head.next
|
|
return true
|
|
}
|
|
|
|
iter.cur = iter.cur.next
|
|
if iter.cur == iter.pl.tail {
|
|
iter.cur = iter.pl.head.next
|
|
}
|
|
|
|
return true
|
|
}
|
|
|
|
func (iter *CircularIterator) MoveToHead() {
|
|
iter.cur = iter.pl.head
|
|
}
|
|
|
|
func (iter *CircularIterator) MoveToTail() {
|
|
iter.cur = iter.pl.tail
|
|
}
|