2015-03-06 16:10:34 +00:00
|
|
|
/*
|
|
|
|
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.
|
|
|
|
*/
|
|
|
|
|
2015-03-05 23:43:33 +00:00
|
|
|
package examples
|
|
|
|
|
|
|
|
import "github.com/emirpasic/gods/maps/hashmap"
|
|
|
|
|
2015-03-07 16:09:47 +00:00
|
|
|
func HashMapExample() {
|
2015-03-05 23:43:33 +00:00
|
|
|
m := hashmap.New() // empty
|
|
|
|
m.Put(1, "x") // 1->x
|
|
|
|
m.Put(2, "b") // 2->b, 1->x (random order)
|
|
|
|
m.Put(1, "a") // 2->b, 1->a (random order)
|
|
|
|
_, _ = m.Get(2) // b, true
|
|
|
|
_, _ = m.Get(3) // nil, false
|
|
|
|
_ = m.Values() // []interface {}{"b", "a"} (random order)
|
|
|
|
_ = m.Keys() // []interface {}{1, 2} (random order)
|
|
|
|
m.Remove(1) // 2->b
|
|
|
|
m.Clear() // empty
|
|
|
|
m.Empty() // true
|
|
|
|
m.Size() // 0
|
|
|
|
}
|