Documentation
¶
Index ¶
- type Iterator
- type Map
- func (m *Map) All(f func(key interface{}, value interface{}) bool) bool
- func (m *Map) Any(f func(key interface{}, value interface{}) bool) bool
- func (m *Map) Clear()
- func (m *Map) Each(f func(key interface{}, value interface{}))
- func (m *Map) Empty() bool
- func (m *Map) Find(f func(key interface{}, value interface{}) bool) (interface{}, interface{})
- func (m *Map) Get(key interface{}) (value interface{}, found bool)
- func (m *Map) Iterator() Iterator
- func (m *Map) Keys() []interface{}
- func (m *Map) Map(f func(key1 interface{}, value1 interface{}) (interface{}, interface{})) *Map
- func (m *Map) Max() (key interface{}, value interface{})
- func (m *Map) Min() (key interface{}, value interface{})
- func (m *Map) Put(key interface{}, value interface{})
- func (m *Map) Remove(key interface{})
- func (m *Map) Select(f func(key interface{}, value interface{}) bool) *Map
- func (m *Map) Size() int
- func (m *Map) String() string
- func (m *Map) Values() []interface{}
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Iterator ¶
type Iterator struct {
// contains filtered or unexported fields
}
func (*Iterator) Key ¶
func (iterator *Iterator) Key() interface{}
Returns the current element's key. Does not modify the state of the iterator.
type Map ¶
type Map struct {
// contains filtered or unexported fields
}
func NewWith ¶
func NewWith(comparator utils.Comparator) *Map
Instantiates a tree map with the custom comparator.
func NewWithIntComparator ¶
func NewWithIntComparator() *Map
Instantiates a tree map with the IntComparator, i.e. keys are of type int.
func NewWithStringComparator ¶
func NewWithStringComparator() *Map
Instantiates a tree map with the StringComparator, i.e. keys are of type string.
func (*Map) All ¶
Passes each element of the container to the given function and returns true if the function returns true for all elements.
func (*Map) Any ¶
Passes each element of the container to the given function and returns true if the function ever returns true for any element.
func (*Map) Each ¶
func (m *Map) Each(f func(key interface{}, value interface{}))
Calls the given function once for each element, passing that element's key and value.
func (*Map) Find ¶
Passes each element of the container to the given function and returns the first (key,value) for which the function is true or nil,nil otherwise if no element matches the criteria.
func (*Map) Get ¶
Searches the element in the map by key and returns its value or nil if key is not found in tree. Second return parameter is true if key was found, otherwise false. Key should adhere to the comparator's type assertion, otherwise method panics.
func (*Map) Map ¶
Invokes the given function once for each element and returns a container containing the values returned by the given function as key/value pairs.
func (*Map) Max ¶
func (m *Map) Max() (key interface{}, value interface{})
Returns the maximum key and its value from the tree map. Returns nil, nil if map is empty.
func (*Map) Min ¶
func (m *Map) Min() (key interface{}, value interface{})
Returns the minimum key and its value from the tree map. Returns nil, nil if map is empty.
func (*Map) Put ¶
func (m *Map) Put(key interface{}, value interface{})
Inserts key-value pair into the map. Key should adhere to the comparator's type assertion, otherwise method panics.
func (*Map) Remove ¶
func (m *Map) Remove(key interface{})
Remove the element from the map by key. Key should adhere to the comparator's type assertion, otherwise method panics.
Source Files