mirror of
https://github.com/emirpasic/gods
synced 2024-11-06 15:20:25 +00:00
92 lines
3.2 KiB
Go
92 lines
3.2 KiB
Go
/*
|
|
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.
|
|
*/
|
|
|
|
package examples
|
|
|
|
import (
|
|
"fmt"
|
|
"github.com/emirpasic/gods/maps/treemap"
|
|
"strconv"
|
|
)
|
|
|
|
func prettyPrint(m *treemap.Map) {
|
|
fmt.Print("{ ")
|
|
m.Each(func(key interface{}, value interface{}) {
|
|
fmt.Print(key.(string) + ": " + strconv.Itoa(value.(int)) + " ")
|
|
})
|
|
fmt.Println("}")
|
|
}
|
|
|
|
func EnumerableWithKeyExample() {
|
|
m := treemap.NewWithStringComparator()
|
|
m.Put("g", 7)
|
|
m.Put("f", 6)
|
|
m.Put("e", 5)
|
|
m.Put("d", 4)
|
|
m.Put("c", 3)
|
|
m.Put("b", 2)
|
|
m.Put("a", 1)
|
|
prettyPrint(m) // { a: 1 b: 2 c: 3 d: 4 e: 5 f: 6 g: 7 }
|
|
|
|
// Selects all elements with even values into a new map.
|
|
even := m.Select(func(key interface{}, value interface{}) bool {
|
|
return value.(int)%2 == 0
|
|
})
|
|
prettyPrint(even) // { b: 2 d: 4 f: 6 }
|
|
|
|
// Finds first element whose value is divisible by 2 and 3
|
|
foundKey, foundValue := m.Find(func(key interface{}, value interface{}) bool {
|
|
return value.(int)%2 == 0 && value.(int)%3 == 0
|
|
})
|
|
fmt.Println(foundKey, foundValue) // key: f, value: 6
|
|
|
|
// Creates a new map containing same elements with their values squared and letters duplicated.
|
|
square := m.Map(func(key interface{}, value interface{}) (interface{}, interface{}) {
|
|
return key.(string) + key.(string), value.(int) * value.(int)
|
|
})
|
|
prettyPrint(square) // { aa: 1 bb: 4 cc: 9 dd: 16 ee: 25 ff: 36 gg: 49 }
|
|
|
|
// Tests if any element contains value that is bigger than 5
|
|
bigger := m.Any(func(key interface{}, value interface{}) bool {
|
|
return value.(int) > 5
|
|
})
|
|
fmt.Println(bigger) // true
|
|
|
|
// Tests if all elements' values are positive
|
|
positive := m.All(func(key interface{}, value interface{}) bool {
|
|
return value.(int) > 0
|
|
})
|
|
fmt.Println(positive) // true
|
|
|
|
// Chaining
|
|
evenNumbersSquared := m.Select(func(key interface{}, value interface{}) bool {
|
|
return value.(int)%2 == 0
|
|
}).Map(func(key interface{}, value interface{}) (interface{}, interface{}) {
|
|
return key, value.(int) * value.(int)
|
|
})
|
|
prettyPrint(evenNumbersSquared) // { b: 4 d: 16 f: 36 }
|
|
}
|