func (s *Uint) Subset(s2 *Uint) bool {
	for i := range s.nodeMap {
		_, ok := s2.nodeMap[i]
		if !ok {
			return false
		}
	}
	return true
}
Subset checks if S is subset of S2
package set
type Uint struct {
	nodeMap map[uint]struct{}
}
func NewUint(nums []uint) *Uint {
	s := &Uint{}
	for _, num := range nums {
		s.Add(num)
	}
	return s
}
func (s *Uint) Add(num uint) *Uint {
	if s.nodeMap == nil {
		s.nodeMap = make(map[uint]struct{})
	}
	_, ok := s.nodeMap[num]
	if !ok {
		s.nodeMap[num] = struct{}{}
	}
	return s
}
func (s *Uint) Clear() {
	s.nodeMap = make(map[uint]struct{})
}
func (s *Uint) Remove(num uint) bool {
	_, ok := s.nodeMap[num]
	if ok {
		delete(s.nodeMap, num)
	}
	return ok
}
func (s *Uint) Contains(num uint) bool {
	_, ok := s.nodeMap[num]
	return ok
}
func (s *Uint) GetList() []uint {
	nums := []uint{}
	for i := range s.nodeMap {
		nums = append(nums, i)
	}
	return nums
}
func (s *Uint) Size() int {
	return len(s.nodeMap)
}
func (s *Uint) Union(s2 *Uint) *Uint {
	s3 := Uint{}
	s3.nodeMap = make(map[uint]struct{})
	for i := range s.nodeMap {
		s3.nodeMap[i] = struct{}{}
	}
	for i := range s2.nodeMap {
		_, ok := s3.nodeMap[i]
		if !ok {
			s3.nodeMap[i] = struct{}{}
		}
	}
	return &s3
}
func (s *Uint) Intersection(s2 *Uint) *Uint {
	s3 := Uint{}
	s3.nodeMap = make(map[uint]struct{})
	for i := range s2.nodeMap {
		_, ok := s.nodeMap[i]
		if ok {
			s3.nodeMap[i] = struct{}{}
		}
	}
	return &s3
}
func (s *Uint) Minus(s2 *Uint) *Uint {
	s3 := Uint{}
	s3.nodeMap = make(map[uint]struct{})
	for i := range s.nodeMap {
		_, ok := s2.nodeMap[i]
		if !ok {
			s3.nodeMap[i] = struct{}{}
		}
	}
	return &s3
}