-
Notifications
You must be signed in to change notification settings - Fork 44
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
replace generic set implemetation with plain set (unstable in go1.19)
Signed-off-by: Alex Goodman <alex.goodman@anchore.com>
- Loading branch information
Showing
16 changed files
with
1,052 additions
and
186 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,76 @@ | ||
| package internal | ||
|
|
||
| import ( | ||
| "sort" | ||
| ) | ||
|
|
||
| type StringSet map[string]struct{} | ||
|
|
||
| func NewStringSet(is ...string) StringSet { | ||
| // TODO: replace with single generic implementation that also incorporates other set implementations | ||
| s := make(StringSet) | ||
| s.Add(is...) | ||
| return s | ||
| } | ||
|
|
||
| func (s StringSet) Size() int { | ||
| return len(s) | ||
| } | ||
|
|
||
| func (s StringSet) Merge(other StringSet) { | ||
| for _, i := range other.List() { | ||
| s.Add(i) | ||
| } | ||
| } | ||
|
|
||
| func (s StringSet) Add(ids ...string) { | ||
| for _, i := range ids { | ||
| s[i] = struct{}{} | ||
| } | ||
| } | ||
|
|
||
| func (s StringSet) Remove(ids ...string) { | ||
| for _, i := range ids { | ||
| delete(s, i) | ||
| } | ||
| } | ||
|
|
||
| func (s StringSet) Contains(i string) bool { | ||
| _, ok := s[i] | ||
| return ok | ||
| } | ||
|
|
||
| func (s StringSet) Clear() { | ||
| // TODO: replace this with the new 'clear' keyword when it's available in go 1.20 or 1.21 | ||
| for i := range s { | ||
| delete(s, i) | ||
| } | ||
| } | ||
|
|
||
| func (s StringSet) List() []string { | ||
| ret := make([]string, 0, len(s)) | ||
| for i := range s { | ||
| ret = append(ret, i) | ||
| } | ||
| return ret | ||
| } | ||
|
|
||
| func (s StringSet) Sorted() []string { | ||
| ids := s.List() | ||
|
|
||
| sort.Slice(ids, func(i, j int) bool { | ||
| return ids[i] < ids[j] | ||
| }) | ||
|
|
||
| return ids | ||
| } | ||
|
|
||
| func (s StringSet) ContainsAny(ids ...string) bool { | ||
| for _, i := range ids { | ||
| _, ok := s[i] | ||
| if ok { | ||
| return true | ||
| } | ||
| } | ||
| return false | ||
| } |
Oops, something went wrong.