mirror of https://github.com/emirpasic/gods
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
76 lines
2.5 KiB
Go
76 lines
2.5 KiB
Go
8 years ago
|
/*
|
||
|
Copyright (c) 2015, Emir Pasic
|
||
|
All rights reserved.
|
||
|
|
||
|
Redistribution and use in source and binary forms, with or without
|
||
|
modification, are permitted provided that the following conditions are met:
|
||
|
|
||
|
* Redistributions of source code must retain the above copyright notice, this
|
||
|
list of conditions and the following disclaimer.
|
||
|
|
||
|
* Redistributions in binary form must reproduce the above copyright notice,
|
||
|
this list of conditions and the following disclaimer in the documentation
|
||
|
and/or other materials provided with the distribution.
|
||
|
|
||
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
||
|
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
||
|
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
||
|
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||
|
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
8 years ago
|
package examples
|
||
8 years ago
|
|
||
|
import (
|
||
|
"fmt"
|
||
8 years ago
|
"github.com/emirpasic/gods/maps/treemap"
|
||
8 years ago
|
)
|
||
|
|
||
8 years ago
|
// IteratorWithKeyExample to demonstrate basic usage of IteratorWithKey
|
||
|
func IteratorWithKeyExample() {
|
||
|
m := treemap.NewWithIntComparator()
|
||
|
m.Put(1, "a")
|
||
|
m.Put(2, "b")
|
||
|
m.Put(3, "a")
|
||
|
it := m.Iterator()
|
||
8 years ago
|
|
||
8 years ago
|
fmt.Print("\nForward iteration\n")
|
||
8 years ago
|
for it.Next() {
|
||
8 years ago
|
key, value := it.Key(), it.Value()
|
||
|
fmt.Print("[", key, ":", value, "]") // [0:a][1:b][2:c]
|
||
8 years ago
|
}
|
||
|
|
||
8 years ago
|
fmt.Print("\nForward iteration (again)\n")
|
||
|
for it.Begin(); it.Next(); {
|
||
|
key, value := it.Key(), it.Value()
|
||
|
fmt.Print("[", key, ":", value, "]") // [0:a][1:b][2:c]
|
||
|
}
|
||
|
|
||
|
fmt.Print("\nBackward iteration\n")
|
||
|
for it.Prev() {
|
||
|
key, value := it.Key(), it.Value()
|
||
|
fmt.Print("[", key, ":", value, "]") // [2:c][1:b][0:a]
|
||
|
}
|
||
|
|
||
|
fmt.Print("\nBackward iteration (again)\n")
|
||
|
for it.End(); it.Prev(); {
|
||
|
key, value := it.Key(), it.Value()
|
||
|
fmt.Print("[", key, ":", value, "]") // [2:c][1:b][0:a]
|
||
|
}
|
||
|
|
||
|
if it.First() {
|
||
|
fmt.Print("\nFirst key: ", it.Key()) // First key: 0
|
||
|
fmt.Print("\nFirst value: ", it.Value()) // First value: a
|
||
|
}
|
||
|
|
||
|
if it.Last() {
|
||
|
fmt.Print("\nLast key: ", it.Key()) // Last key: 3
|
||
|
fmt.Print("\nLast value: ", it.Value()) // Last value: c
|
||
8 years ago
|
}
|
||
|
}
|