summaryrefslogtreecommitdiff
path: root/vendor/github.com/minio/minio-go/v7/pkg/set/stringset.go
diff options
context:
space:
mode:
Diffstat (limited to 'vendor/github.com/minio/minio-go/v7/pkg/set/stringset.go')
-rw-r--r--vendor/github.com/minio/minio-go/v7/pkg/set/stringset.go195
1 files changed, 0 insertions, 195 deletions
diff --git a/vendor/github.com/minio/minio-go/v7/pkg/set/stringset.go b/vendor/github.com/minio/minio-go/v7/pkg/set/stringset.go
deleted file mode 100644
index c265ce572..000000000
--- a/vendor/github.com/minio/minio-go/v7/pkg/set/stringset.go
+++ /dev/null
@@ -1,195 +0,0 @@
-/*
- * 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"
-
- "github.com/goccy/go-json"
-)
-
-// StringSet - uses map as set of strings.
-type StringSet map[string]struct{}
-
-// 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.
-func (set *StringSet) UnmarshalJSON(data []byte) error {
- sl := []interface{}{}
- var err error
- if err = json.Unmarshal(data, &sl); err == nil {
- *set = make(StringSet)
- for _, s := range sl {
- set.Add(fmt.Sprintf("%v", s))
- }
- } else {
- var s interface{}
- if err = json.Unmarshal(data, &s); err == nil {
- *set = make(StringSet)
- set.Add(fmt.Sprintf("%v", 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
-}