datastore

Documentation

Index

• func BinarySearch(content string, origin_arr []string) (resarray []string)
• func BinarySearchForMap[T interface{}](content string, origin_map map[string]T) (resmap map[string]T)
• func Comparestr(target string, tocompare string, compare_rate int) bool
• type ArrayQueen
  • func NewQueen[T basictype]() *ArrayQueen[T]
  • func (s *ArrayQueen[T]) Add(value T)
  • func (s *ArrayQueen[T]) Peek() T
  • func (s *ArrayQueen[T]) PrintQueen()
  • func (s *ArrayQueen[T]) Remove()
• type ArrayStack
  • func NewStack[T basictype]() *ArrayStack[T]
  • func (s *ArrayStack[T]) Peek() T
  • func (s *ArrayStack[T]) Pop() T
  • func (s *ArrayStack[T]) PrintArray()
  • func (s *ArrayStack[T]) Push(value T)
• type Heap
  • func (s *Heap[T]) Isempty() bool
  • func (s *Heap[T]) Pop() (ans T)
  • func (s *Heap[T]) Push_Back(val T)
  • func (s *Heap[T]) Size() int
  • func (s *Heap[T]) Top() (ans T)
• type LinkList
  • func NewList[T basictype](value T) *LinkList[T]
  • func (s *LinkList[T]) AddAfterValue(sourcevalue, value T)
  • func (s *LinkList[T]) AddBeforeValue(sourcevalue T, value T)
  • func (s *LinkList[T]) AddFirst(value T)
  • func (s *LinkList[T]) AddLast(value T)
  • func (s *LinkList[T]) DeleteFirst()
  • func (s *LinkList[T]) DeleteLast()
  • func (s *LinkList[T]) GetVal() T
  • func (s *LinkList[T]) PrintList()
  • func (s *LinkList[T]) Toarray() []T
• type ListQueen
  • func NewListQueen[T basictype]() *ListQueen[T]
  • func (s *ListQueen[T]) Add(value T)
  • func (s *ListQueen[T]) Peek() T
  • func (s *ListQueen[T]) PrintQueen()
  • func (s *ListQueen[T]) Remove()
• type ListStack
  • func NewListStack[T basictype]() *ListStack[T]
  • func (s *ListStack[T]) Peek() *LinkList[T]
  • func (s *ListStack[T]) Pop() *LinkList[T]
  • func (s *ListStack[T]) PrintStack()
  • func (s *ListStack[T]) Push(value T)

Functions

func BinarySearch

func BinarySearch(content string, origin_arr []string) (resarray []string)

func BinarySearchForMap

func BinarySearchForMap[T interface{}](content string, origin_map map[string]T) (resmap map[string]T)

binary search for map

func Comparestr

func Comparestr(target string, tocompare string, compare_rate int) bool

liststack end fuzzy match version 1.0

Types

type ArrayQueen

type ArrayQueen[T basictype] struct {
	// contains filtered or unexported fields
}

func NewQueen

func NewQueen[T basictype]() *ArrayQueen[T]

arraystack end arrayqueen start

func (*ArrayQueen[T]) Add

func (s *ArrayQueen[T]) Add(value T)

func (*ArrayQueen[T]) Peek

func (s *ArrayQueen[T]) Peek() T

func (*ArrayQueen[T]) PrintQueen

func (s *ArrayQueen[T]) PrintQueen()

func (*ArrayQueen[T]) Remove

func (s *ArrayQueen[T]) Remove()

type ArrayStack

type ArrayStack[T basictype] struct {
	// contains filtered or unexported fields
}

func NewStack

func NewStack[T basictype]() *ArrayStack[T]

arraystack start

func (*ArrayStack[T]) Peek

func (s *ArrayStack[T]) Peek() T

func (*ArrayStack[T]) Pop

func (s *ArrayStack[T]) Pop() T

func (*ArrayStack[T]) PrintArray

func (s *ArrayStack[T]) PrintArray()

func (*ArrayStack[T]) Push

func (s *ArrayStack[T]) Push(value T)

type Heap

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

func (*Heap[T]) Isempty

func (s *Heap[T]) Isempty() bool

func (*Heap[T]) Pop

func (s *Heap[T]) Pop() (ans T)

func (*Heap[T]) Push_Back

func (s *Heap[T]) Push_Back(val T)

func (*Heap[T]) Size

func (s *Heap[T]) Size() int

func (*Heap[T]) Top

func (s *Heap[T]) Top() (ans T)

type LinkList

type LinkList[T basictype] struct {
	// contains filtered or unexported fields
}

func NewList

func NewList[T basictype](value T) *LinkList[T]

arrayqueen end linklist start

func (*LinkList[T]) AddAfterValue

func (s *LinkList[T]) AddAfterValue(sourcevalue, value T)

func (*LinkList[T]) AddBeforeValue

func (s *LinkList[T]) AddBeforeValue(sourcevalue T, value T)

func (*LinkList[T]) AddFirst

func (s *LinkList[T]) AddFirst(value T)

func (*LinkList[T]) AddLast

func (s *LinkList[T]) AddLast(value T)

func (*LinkList[T]) DeleteFirst

func (s *LinkList[T]) DeleteFirst()

func (*LinkList[T]) DeleteLast

func (s *LinkList[T]) DeleteLast()

func (*LinkList[T]) GetVal

func (s *LinkList[T]) GetVal() T

func (*LinkList[T]) PrintList

func (s *LinkList[T]) PrintList()

func (*LinkList[T]) Toarray

func (s *LinkList[T]) Toarray() []T

type ListQueen

type ListQueen[T basictype] struct {
	// contains filtered or unexported fields
}

func NewListQueen

func NewListQueen[T basictype]() *ListQueen[T]

linklist end listqueen start

func (*ListQueen[T]) Add

func (s *ListQueen[T]) Add(value T)

func (*ListQueen[T]) Peek

func (s *ListQueen[T]) Peek() T

func (*ListQueen[T]) PrintQueen

func (s *ListQueen[T]) PrintQueen()

func (*ListQueen[T]) Remove

func (s *ListQueen[T]) Remove()

type ListStack

type ListStack[T basictype] struct {
	// contains filtered or unexported fields
}

func NewListStack

func NewListStack[T basictype]() *ListStack[T]

listqueen end liststack start

func (*ListStack[T]) Peek

func (s *ListStack[T]) Peek() *LinkList[T]

func (*ListStack[T]) Pop

func (s *ListStack[T]) Pop() *LinkList[T]

func (*ListStack[T]) PrintStack

func (s *ListStack[T]) PrintStack()

func (*ListStack[T]) Push

func (s *ListStack[T]) Push(value T)