123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200 |
- /*
- * MinIO Go Library for Amazon S3 Compatible Cloud Storage
- * Copyright 2015-2017 MinIO, Inc.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
- package set
- import (
- "fmt"
- "sort"
- jsoniter "github.com/json-iterator/go"
- )
- // StringSet - uses map as set of strings.
- type StringSet map[string]struct{}
- var json = jsoniter.ConfigCompatibleWithStandardLibrary
- // ToSlice - returns StringSet as string slice.
- func (set StringSet) ToSlice() []string {
- keys := make([]string, 0, len(set))
- for k := range set {
- keys = append(keys, k)
- }
- sort.Strings(keys)
- return keys
- }
- // IsEmpty - returns whether the set is empty or not.
- func (set StringSet) IsEmpty() bool {
- return len(set) == 0
- }
- // Add - adds string to the set.
- func (set StringSet) Add(s string) {
- set[s] = struct{}{}
- }
- // Remove - removes string in the set. It does nothing if string does not exist in the set.
- func (set StringSet) Remove(s string) {
- delete(set, s)
- }
- // Contains - checks if string is in the set.
- func (set StringSet) Contains(s string) bool {
- _, ok := set[s]
- return ok
- }
- // FuncMatch - returns new set containing each value who passes match function.
- // A 'matchFn' should accept element in a set as first argument and
- // 'matchString' as second argument. The function can do any logic to
- // compare both the arguments and should return true to accept element in
- // a set to include in output set else the element is ignored.
- func (set StringSet) FuncMatch(matchFn func(string, string) bool, matchString string) StringSet {
- nset := NewStringSet()
- for k := range set {
- if matchFn(k, matchString) {
- nset.Add(k)
- }
- }
- return nset
- }
- // ApplyFunc - returns new set containing each value processed by 'applyFn'.
- // A 'applyFn' should accept element in a set as a argument and return
- // a processed string. The function can do any logic to return a processed
- // string.
- func (set StringSet) ApplyFunc(applyFn func(string) string) StringSet {
- nset := NewStringSet()
- for k := range set {
- nset.Add(applyFn(k))
- }
- return nset
- }
- // Equals - checks whether given set is equal to current set or not.
- func (set StringSet) Equals(sset StringSet) bool {
- // If length of set is not equal to length of given set, the
- // set is not equal to given set.
- if len(set) != len(sset) {
- return false
- }
- // As both sets are equal in length, check each elements are equal.
- for k := range set {
- if _, ok := sset[k]; !ok {
- return false
- }
- }
- return true
- }
- // Intersection - returns the intersection with given set as new set.
- func (set StringSet) Intersection(sset StringSet) StringSet {
- nset := NewStringSet()
- for k := range set {
- if _, ok := sset[k]; ok {
- nset.Add(k)
- }
- }
- return nset
- }
- // Difference - returns the difference with given set as new set.
- func (set StringSet) Difference(sset StringSet) StringSet {
- nset := NewStringSet()
- for k := range set {
- if _, ok := sset[k]; !ok {
- nset.Add(k)
- }
- }
- return nset
- }
- // Union - returns the union with given set as new set.
- func (set StringSet) Union(sset StringSet) StringSet {
- nset := NewStringSet()
- for k := range set {
- nset.Add(k)
- }
- for k := range sset {
- nset.Add(k)
- }
- return nset
- }
- // MarshalJSON - converts to JSON data.
- func (set StringSet) MarshalJSON() ([]byte, error) {
- return json.Marshal(set.ToSlice())
- }
- // UnmarshalJSON - parses JSON data and creates new set with it.
- // If 'data' contains JSON string array, the set contains each string.
- // If 'data' contains JSON string, the set contains the string as one element.
- // If 'data' contains Other JSON types, JSON parse error is returned.
- func (set *StringSet) UnmarshalJSON(data []byte) error {
- sl := []string{}
- var err error
- if err = json.Unmarshal(data, &sl); err == nil {
- *set = make(StringSet)
- for _, s := range sl {
- set.Add(s)
- }
- } else {
- var s string
- if err = json.Unmarshal(data, &s); err == nil {
- *set = make(StringSet)
- set.Add(s)
- }
- }
- return err
- }
- // String - returns printable string of the set.
- func (set StringSet) String() string {
- return fmt.Sprintf("%s", set.ToSlice())
- }
- // NewStringSet - creates new string set.
- func NewStringSet() StringSet {
- return make(StringSet)
- }
- // CreateStringSet - creates new string set with given string values.
- func CreateStringSet(sl ...string) StringSet {
- set := make(StringSet)
- for _, k := range sl {
- set.Add(k)
- }
- return set
- }
- // CopyStringSet - returns copy of given set.
- func CopyStringSet(set StringSet) StringSet {
- nset := NewStringSet()
- for k, v := range set {
- nset[k] = v
- }
- return nset
- }
|