set

README

Package set

set.

Usage

example

package main

import (
	"log"

	"github.com/QisFj/godry/set"
)

func main() {
	log.Println("Int Set:")
	intSet()
	log.Println("String Set:")
	stringSet()
}

func intSet() {
	s := set.Of(1, 1, 1, 2, 2, 2)
	log.Printf("set list: %v\n", s.List())
}

func stringSet() {
	s := set.Of("1", "1", "1", "2", "2", "2")
	log.Printf("set list: %v\n", s.List())
}

Documentation

Index

• Variables
• func AscLess[V constraints.Ordered](v1, v2 V) bool
• func DescLess[V constraints.Ordered](v1, v2 V) bool
• type Set
  • func Diff[V comparable](s1, s2 Set[V]) (both, only1, only2 Set[V])
  • func Intersect[V comparable](s1, s2 Set[V]) Set[V]
  • func Of[V comparable](values ...V) Set[V]
  • func Subtract[V comparable](s1, s2 Set[V]) Set[V]
  • func Union[V comparable](s1, s2 Set[V]) Set[V]
  • func (s *Set[V]) Add(values ...V)
  • func (s Set[V]) AddSet(another Set[V])
  • func (s Set[V]) Clone() Set[V]
  • func (s Set[V]) Contains(value V) bool
  • func (s Set[V]) ContainsAll(values ...V) bool
  • func (s Set[V]) ContainsAllOfSet(another Set[V]) bool
  • func (s Set[V]) ContainsAny(values ...V) bool
  • func (s Set[V]) ContainsAnyOfSet(another Set[V]) bool
  • func (s Set[V]) List() []V
  • func (s Set[V]) MarshalJSON() ([]byte, error)
  • func (s *Set[V]) Remove(values ...V)
  • func (s Set[V]) RemoveSet(another Set[V])
  • func (s *Set[V]) UnmarshalJSON(data []byte) error
• type SortableSet
  • func (s SortableSet[V]) MarshalJSON() ([]byte, error)
  • func (s SortableSet[V]) OrderedList(less func(v1, v2 V) bool) []V
  • func (s *SortableSet[V]) UnmarshalJSON(data []byte) error
• type T
  • func NewT(t reflect.Type) T
  • func TDiff(s1, s2 T) (both, only1, only2 T)
  • func TIntersect(s1, s2 T) T
  • func TSubtract(s1, s2 T) T
  • func TUnion(s1, s2 T) T
  • func (set *T) Add(es ...interface{})
  • func (set *T) AddSet(another T)
  • func (set T) Clone() T
  • func (set T) Contains(e interface{}) bool
  • func (set T) ContainsAll(es ...interface{}) bool
  • func (set T) ContainsAny(es ...interface{}) bool
  • func (set T) List() interface{}
  • func (set *T) New(t reflect.Type)
  • func (set *T) Remove(es ...interface{})
  • func (set *T) RemoveSet(another T)

Variables

var MarshalOrder = 0

MarshalOrder can change the order of the elements when marshaling. 1 for desc 2 for asc 0 or other value for no certain order

Functions

func AscLess

func AscLess[V constraints.Ordered](v1, v2 V) bool

func DescLess

func DescLess[V constraints.Ordered](v1, v2 V) bool

Types

type Set

type Set[V comparable] map[V]struct{}

func Diff

func Diff[V comparable](s1, s2 Set[V]) (both, only1, only2 Set[V])

func Intersect

func Intersect[V comparable](s1, s2 Set[V]) Set[V]

func Of

func Of[V comparable](values ...V) Set[V]

func Subtract

func Subtract[V comparable](s1, s2 Set[V]) Set[V]

func Union

func Union[V comparable](s1, s2 Set[V]) Set[V]

func (*Set[V]) Add

func (s *Set[V]) Add(values ...V)

func (Set[V]) AddSet

func (s Set[V]) AddSet(another Set[V])

func (Set[V]) Clone

func (s Set[V]) Clone() Set[V]

func (Set[V]) Contains

func (s Set[V]) Contains(value V) bool

func (Set[V]) ContainsAll

func (s Set[V]) ContainsAll(values ...V) bool

func (Set[V]) ContainsAllOfSet

func (s Set[V]) ContainsAllOfSet(another Set[V]) bool

func (Set[V]) ContainsAny

func (s Set[V]) ContainsAny(values ...V) bool

func (Set[V]) ContainsAnyOfSet

func (s Set[V]) ContainsAnyOfSet(another Set[V]) bool

func (Set[V]) List

func (s Set[V]) List() []V

func (Set[V]) MarshalJSON

func (s Set[V]) MarshalJSON() ([]byte, error)

func (*Set[V]) Remove

func (s *Set[V]) Remove(values ...V)

func (Set[V]) RemoveSet

func (s Set[V]) RemoveSet(another Set[V])

func (*Set[V]) UnmarshalJSON

func (s *Set[V]) UnmarshalJSON(data []byte) error

type SortableSet

type SortableSet[V constraints.Ordered] map[V]struct{}

func (SortableSet[V]) MarshalJSON

func (s SortableSet[V]) MarshalJSON() ([]byte, error)

func (SortableSet[V]) OrderedList

func (s SortableSet[V]) OrderedList(less func(v1, v2 V) bool) []V

OrderedList return an ordered list can use AscLess, DescLess as less function

func (*SortableSet[V]) UnmarshalJSON

func (s *SortableSet[V]) UnmarshalJSON(data []byte) error

type T

type T struct {
	// contains filtered or unexported fields
}

func NewT

func NewT(t reflect.Type) T

func TDiff

func TDiff(s1, s2 T) (both, only1, only2 T)

func TIntersect

func TIntersect(s1, s2 T) T

func TSubtract

func TSubtract(s1, s2 T) T

func TUnion

func TUnion(s1, s2 T) T

func (*T) Add

func (set *T) Add(es ...interface{})

func (*T) AddSet

func (set *T) AddSet(another T)

func (T) Clone

func (set T) Clone() T

func (T) Contains

func (set T) Contains(e interface{}) bool

func (T) ContainsAll

func (set T) ContainsAll(es ...interface{}) bool

func (T) ContainsAny

func (set T) ContainsAny(es ...interface{}) bool

func (T) List

func (set T) List() interface{}

func (*T) New

func (set *T) New(t reflect.Type)

func (*T) Remove

func (set *T) Remove(es ...interface{})

func (*T) RemoveSet

func (set *T) RemoveSet(another T)