gods: github.com/emirpasic/gods/sets/linkedhashset Index | Files

package linkedhashset

import "github.com/emirpasic/gods/sets/linkedhashset"

Package linkedhashset is a set that preserves insertion-order.

It is backed by a hash table to store values and doubly-linked list to store ordering.

Note that insertion-order is not affected if an element is re-inserted into the set.

Structure is not thread safe.

References: http://en.wikipedia.org/wiki/Set_%28abstract_data_type%29

Index

Package Files

enumerable.go iterator.go linkedhashset.go serialization.go

type Iterator Uses

type Iterator struct {
    // contains filtered or unexported fields
}

Iterator holding the iterator's state

func (*Iterator) Begin Uses

func (iterator *Iterator) Begin()

Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.

func (*Iterator) End Uses

func (iterator *Iterator) End()

End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.

func (*Iterator) First Uses

func (iterator *Iterator) First() bool

First moves the iterator to the first element and returns true if there was a first element in the container. If First() returns true, then first element's index and value can be retrieved by Index() and Value(). Modifies the state of the iterator.

func (*Iterator) Index Uses

func (iterator *Iterator) Index() int

Index returns the current element's index. Does not modify the state of the iterator.

func (*Iterator) Last Uses

func (iterator *Iterator) Last() bool

Last moves the iterator to the last element and returns true if there was a last element in the container. If Last() returns true, then last element's index and value can be retrieved by Index() and Value(). Modifies the state of the iterator.

func (*Iterator) Next Uses

func (iterator *Iterator) Next() bool

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's index and value can be retrieved by Index() and Value(). If Next() was called for the first time, then it will point the iterator to the first element if it exists. Modifies the state of the iterator.

func (*Iterator) Prev Uses

func (iterator *Iterator) Prev() bool

Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previous element's index and value can be retrieved by Index() and Value(). Modifies the state of the iterator.

func (*Iterator) Value Uses

func (iterator *Iterator) Value() interface{}

Value returns the current element's value. Does not modify the state of the iterator.

type Set Uses

type Set struct {
    // contains filtered or unexported fields
}

Set holds elements in go's native map

func New Uses

func New(values ...interface{}) *Set

New instantiates a new empty set and adds the passed values, if any, to the set

func (*Set) Add Uses

func (set *Set) Add(items ...interface{})

Add adds the items (one or more) to the set. Note that insertion-order is not affected if an element is re-inserted into the set.

func (*Set) All Uses

func (set *Set) All(f func(index int, value interface{}) bool) bool

All passes each element of the container to the given function and returns true if the function returns true for all elements.

func (*Set) Any Uses

func (set *Set) Any(f func(index int, value interface{}) bool) bool

Any passes each element of the container to the given function and returns true if the function ever returns true for any element.

func (*Set) Clear Uses

func (set *Set) Clear()

Clear clears all values in the set.

func (*Set) Contains Uses

func (set *Set) Contains(items ...interface{}) bool

Contains check if items (one or more) are present in the set. All items have to be present in the set for the method to return true. Returns true if no arguments are passed at all, i.e. set is always superset of empty set.

func (*Set) Each Uses

func (set *Set) Each(f func(index int, value interface{}))

Each calls the given function once for each element, passing that element's index and value.

func (*Set) Empty Uses

func (set *Set) Empty() bool

Empty returns true if set does not contain any elements.

func (*Set) Find Uses

func (set *Set) Find(f func(index int, value interface{}) bool) (int, interface{})

Find passes each element of the container to the given function and returns the first (index,value) for which the function is true or -1,nil otherwise if no element matches the criteria.

func (*Set) FromJSON Uses

func (set *Set) FromJSON(data []byte) error

FromJSON populates the set from the input JSON representation.

func (*Set) Iterator Uses

func (set *Set) Iterator() Iterator

Iterator returns a stateful iterator whose values can be fetched by an index.

func (*Set) Map Uses

func (set *Set) Map(f func(index int, value interface{}) interface{}) *Set

Map invokes the given function once for each element and returns a container containing the values returned by the given function.

func (*Set) Remove Uses

func (set *Set) Remove(items ...interface{})

Remove removes the items (one or more) from the set. Slow operation, worst-case O(n^2).

func (*Set) Select Uses

func (set *Set) Select(f func(index int, value interface{}) bool) *Set

Select returns a new container containing all elements for which the given function returns a true value.

func (*Set) Size Uses

func (set *Set) Size() int

Size returns number of elements within the set.

func (*Set) String Uses

func (set *Set) String() string

String returns a string representation of container

func (*Set) ToJSON Uses

func (set *Set) ToJSON() ([]byte, error)

ToJSON outputs the JSON representation of the set.

func (*Set) Values Uses

func (set *Set) Values() []interface{}

Values returns all items in the set.

Package linkedhashset imports 6 packages (graph) and is imported by 2 packages. Updated 2018-09-25. Refresh now. Tools for package owners.