base

package

v0.0.3 Latest Latest Go to latest Published: Feb 1, 2024 License: Apache-2.0 Imports: 3 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type HashSet[T comparable] struct {
	// contains filtered or unexported fields
}

HashSet 这是一个 set 结构（去重）

func NewHashSet[T comparable]() *HashSet[T]

func (h *HashSet[T]) Add(item T)

func (h *HashSet[T]) Contains(item T) bool

func (h *HashSet[T]) Items() []T

func (h *HashSet[T]) Length() int

func (h *HashSet[T]) Remove(item T)

type List[T any] struct {
	// contains filtered or unexported fields
}

List 这是一个 list 的包装

func NewList[T any]() *List[T]

func (l *List[T]) Add(item T)

func (l *List[T]) Clear()

func (l *List[T]) Get(index int) (T, error)

func (l *List[T]) Items() []T

func (l *List[T]) Length() int

func (l *List[T]) Remove(index int) error

type Map[K comparable, V any] struct {
	// contains filtered or unexported fields
}

Map golang 的 map 是无序的有时候其实是需要一个有序的 map 结构

func NewMap[K comparable, V any]() *Map[K, V]

func (m *Map[K, V]) Clear()

func (m *Map[K, V]) Delete(key K)

func (m *Map[K, V]) Get(key K) (V, bool)

func (m *Map[K, V]) Keys() []K

func (m *Map[K, V]) Length() int

func (m *Map[K, V]) Set(key K, value V)

func (m *Map[K, V]) Sort(compare func(a, b K) bool)