package internal

import "sort"

// StringSet represents a set of string types.
type StringSet map[string]struct{}

// NewStringSet creates a new empty StringSet.
func NewStringSet() StringSet {
	return make(StringSet)
}

// NewStringSetFromSlice creates a StringSet populated with values from the given slice.
func NewStringSetFromSlice(start []string) StringSet {
	ret := make(StringSet)
	for _, s := range start {
		ret.Add(s)
	}
	return ret
}

// Add a string to the set.
func (s StringSet) Add(i string) {
	s[i] = struct{}{}
}

// Remove a string from the set.
func (s StringSet) Remove(i string) {
	delete(s, i)
}

// Contains indicates if the given string is contained within the set.
func (s StringSet) Contains(i string) bool {
	_, ok := s[i]
	return ok
}

// ToSlice returns a sorted slice of strings that are contained within the set.
func (s StringSet) ToSlice() []string {
	ret := make([]string, len(s))
	idx := 0
	for v := range s {
		ret[idx] = v
		idx++
	}
	sort.Strings(ret)
	return ret
}