Documentation
¶
Index ¶
- func IsSlice2dEqual[T Element](a, b [][]T) bool
- func IsSliceEqual[T Element](a, b []T) bool
- func ModifyIndex(index int, length int) int
- func Slice2dToString[T Element](slice2d [][]T) string
- func SliceToString[T Element](slice []T) string
- type Array
- func (a *Array[T]) Add(v any)
- func (a *Array[T]) Append(v interface{})
- func (a *Array[T]) Clear()
- func (a *Array[T]) Clone() *Array[T]
- func (a *Array[T]) Contains(v interface{}) bool
- func (a *Array[T]) Find(v interface{}) int
- func (a *Array[T]) Get(index int) (any, bool)
- func (a *Array[T]) GetIterator() *Iterator[T]
- func (a *Array[T]) GetRange(startIndex int, endIndex int) []T
- func (a *Array[T]) IsEquals(other *Array[T], isStrict bool) bool
- func (a *Array[T]) Iter() func() (T, bool)
- func (a *Array[T]) Length() int
- func (a *Array[T]) Remove(v interface{}) interface{}
- func (a *Array[T]) Set(index int, value T)
- func (a *Array[T]) SetRange(startIndex int, endIndex int, values []T)
- type BikeyMap
- func (m *BikeyMap[K1, K2, V]) Add(key1 K1, key2 K2, value V) error
- func (m *BikeyMap[K1, K2, V]) ContainKey1(key1 K1) bool
- func (m *BikeyMap[K1, K2, V]) ContainKey2(key2 K2) bool
- func (m *BikeyMap[K1, K2, V]) ContainKeys(key1 K1, key2 K2) bool
- func (m *BikeyMap[K1, K2, V]) DelByKey1(key1 K1)
- func (m *BikeyMap[K1, K2, V]) DelByKey2(key2 K2)
- func (m *BikeyMap[K1, K2, V]) GetByKey1(key1 K1) (V, bool)
- func (m *BikeyMap[K1, K2, V]) GetByKey2(key2 K2) (V, bool)
- func (m *BikeyMap[K1, K2, V]) GetByKeys(key1 K1, key2 K2) (V, bool)
- func (m *BikeyMap[K1, K2, V]) GetIterator() *Iterator[*Bivalue[K1, K2, V]]
- func (m *BikeyMap[K1, K2, V]) Set(key1 K1, key2 K2, value V)
- func (m *BikeyMap[K1, K2, V]) UpdateByKey1(key1 K1, value *Bivalue[K1, K2, V])
- func (m *BikeyMap[K1, K2, V]) UpdateByKey2(key2 K2, value *Bivalue[K1, K2, V])
- type Bivalue
- type Element
- type Float
- type Int
- type Iterator
- type NestedMap
- type Set
- func (s *Set[T]) Add(element T) bool
- func (s *Set[T]) Clear()
- func (s *Set[T]) Clone() *Set[T]
- func (s *Set[T]) Contains(element T) bool
- func (s *Set[T]) GetIterator() *Iterator[T]
- func (s *Set[T]) Length() int
- func (s *Set[T]) Remove(element T) bool
- func (s *Set[T]) String() string
- func (s *Set[T]) ToSlice() []T
- type UInt
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func IsSlice2dEqual ¶ added in v1.1.0
比較兩個二維 Slice 是否相同
func ModifyIndex ¶ added in v1.2.4
Types ¶
type Array ¶
type Array[T Element] struct { Elements []T }
func (*Array[T]) GetIterator ¶
type BikeyMap ¶ added in v1.1.1
func NewBikeyMap ¶ added in v1.1.1
func (*BikeyMap[K1, K2, V]) ContainKey1 ¶ added in v1.1.1
func (*BikeyMap[K1, K2, V]) ContainKey2 ¶ added in v1.1.1
func (*BikeyMap[K1, K2, V]) ContainKeys ¶ added in v1.1.1
func (*BikeyMap[K1, K2, V]) DelByKey1 ¶ added in v1.1.1
func (m *BikeyMap[K1, K2, V]) DelByKey1(key1 K1)
func (*BikeyMap[K1, K2, V]) DelByKey2 ¶ added in v1.1.1
func (m *BikeyMap[K1, K2, V]) DelByKey2(key2 K2)
func (*BikeyMap[K1, K2, V]) GetIterator ¶ added in v1.1.1
func (*BikeyMap[K1, K2, V]) Set ¶ added in v1.1.1
func (m *BikeyMap[K1, K2, V]) Set(key1 K1, key2 K2, value V)
func (*BikeyMap[K1, K2, V]) UpdateByKey1 ¶ added in v1.1.1
func (*BikeyMap[K1, K2, V]) UpdateByKey2 ¶ added in v1.1.1
type Bivalue ¶ added in v1.1.1
func NewBivalue ¶ added in v1.1.1
type Iterator ¶
type Iterator[V any] struct { // contains filtered or unexported fields }
func NewIterator ¶
type NestedMap ¶ added in v1.1.1
type NestedMap[K1 Element, K2 Element, V Element] struct { // contains filtered or unexported fields }
func NewNestedMap ¶ added in v1.1.1
func (*NestedMap[K1, K2, V]) Add ¶ added in v1.1.1
func (nm *NestedMap[K1, K2, V]) Add(k1 K1, k2 K2, vs []V)
type Set ¶
type Set[T Element] struct { Elements map[T]void // contains filtered or unexported fields }
func (*Set[T]) GetIterator ¶
Click to show internal directories.
Click to hide internal directories.