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.
118 lines
3.3 KiB
Go
118 lines
3.3 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 hashset implements a set backed by a hash table.
|
|
//
|
|
// Structure is not thread safe.
|
|
//
|
|
// References: http://en.wikipedia.org/wiki/Set_%28abstract_data_type%29
|
|
package hashset
|
|
|
|
import (
|
|
"fmt"
|
|
"github.com/emirpasic/gods/sets"
|
|
"strings"
|
|
)
|
|
|
|
func assertInterfaceImplementation() {
|
|
var _ sets.Set = (*Set)(nil)
|
|
}
|
|
|
|
// Set holds elements in go's native map
|
|
type Set struct {
|
|
items map[interface{}]struct{}
|
|
}
|
|
|
|
var itemExists = struct{}{}
|
|
|
|
// New instantiates a new empty set
|
|
func New() *Set {
|
|
return &Set{items: make(map[interface{}]struct{})}
|
|
}
|
|
|
|
// Add adds the items (one or more) to the set.
|
|
func (set *Set) Add(items ...interface{}) {
|
|
for _, item := range items {
|
|
set.items[item] = itemExists
|
|
}
|
|
}
|
|
|
|
// Remove removes the items (one or more) from the set.
|
|
func (set *Set) Remove(items ...interface{}) {
|
|
for _, item := range items {
|
|
delete(set.items, item)
|
|
}
|
|
}
|
|
|
|
// 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 *Set) Contains(items ...interface{}) bool {
|
|
for _, item := range items {
|
|
if _, contains := set.items[item]; !contains {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// Empty returns true if set does not contain any elements.
|
|
func (set *Set) Empty() bool {
|
|
return set.Size() == 0
|
|
}
|
|
|
|
// Size returns number of elements within the set.
|
|
func (set *Set) Size() int {
|
|
return len(set.items)
|
|
}
|
|
|
|
// Clear clears all values in the set.
|
|
func (set *Set) Clear() {
|
|
set.items = make(map[interface{}]struct{})
|
|
}
|
|
|
|
// Values returns all items in the set.
|
|
func (set *Set) Values() []interface{} {
|
|
values := make([]interface{}, set.Size())
|
|
count := 0
|
|
for item := range set.items {
|
|
values[count] = item
|
|
count++
|
|
}
|
|
return values
|
|
}
|
|
|
|
// String returns a string representation of container
|
|
func (set *Set) String() string {
|
|
str := "HashSet\n"
|
|
items := []string{}
|
|
for k := range set.items {
|
|
items = append(items, fmt.Sprintf("%v", k))
|
|
}
|
|
str += strings.Join(items, ", ")
|
|
return str
|
|
}
|