dsg

package module

Go to main page

Versions in this module

v1

v1.4.0

Mar 4, 2024

Changes in this version

+ func IMin(v1 int, v2 int) int

type DirGraph

+ Leaf *LinkSet

+ Root *LinkSet

+ func (dg *DirGraph) GetAllEdge() [][]int

+ func (dg *DirGraph) GetAllNode() []int

+ func (dg *DirGraph) GetInEdge(inode int) []int

+ func (dg *DirGraph) GetOutEdge(inode int) []int

+ func (dg *DirGraph) PrintRootLeaf(fout io.Writer)

type LinkMat

+ func (lm *LinkMat) ClearCol(col int)

+ func (lm *LinkMat) ClearRow(row int)

+ func (lm *LinkMat) GetAllLabel() [][]int

+ func (lm *LinkMat) GetCol(col int) []int

+ func (lm *LinkMat) GetRow(row int) []int

type LinkSet

+ func InitFullLinkSet(size int) *LinkSet

+ func (ls *LinkSet) DeleteCurrentTraverse()

+ func (ls *LinkSet) GetAllLabel() []int

+ func (ls *LinkSet) GetFirstLabel() int

+ type PerfGraph struct

+ func InitPerfGraph(size int) *PerfGraph

+ func LoadPerfGraph(fin io.Reader) *PerfGraph

+ func (pg *PerfGraph) AddEdge(from, to int, time int)

+ func (pg *PerfGraph) CalNodeTimeRange()

+ func (pg *PerfGraph) Save(fout io.Writer)

+ type SAvlNode struct

+ type SAvlTree struct

+ func InitFloatSAvlTree(max_node int) *SAvlTree

+ func InitIntSAvlTree(max_node int) *SAvlTree

+ func InitSAvlTree(comp_func CompFunc, max_node int) *SAvlTree

+ func (tr *SAvlTree) Add(v Value)

+ func (tr *SAvlTree) BalanceLeft(root int) int

+ func (tr *SAvlTree) BalanceRight(root int) int

+ func (tr *SAvlTree) FindLeftNeighbour(root int) int

+ func (tr *SAvlTree) FindRightNeighbour(root int) int

+ func (tr *SAvlTree) FollowPath(path []int) int

+ func (tr *SAvlTree) GetHeight() int

+ func (tr *SAvlTree) GetHeightNode(root int) int

+ func (tr *SAvlTree) Print()

+ func (tr *SAvlTree) PrintNode(root, level int)

+ func (tr *SAvlTree) Remove(v Value)

+ func (tr *SAvlTree) RemoveLeftMostDescendant(root int) (new_root, junk int)

+ func (tr *SAvlTree) RemoveNode(root int, v Value) (new_root, junk int)

+ func (tr *SAvlTree) RestoreLeftBalance(root int, oldbf int) int

+ func (tr *SAvlTree) RestoreRightBalance(root int, oldbf int) int

+ func (tr *SAvlTree) Search(v Value, dir []int) int

+ func (tr *SAvlTree) SearchNode(root int, v Value, dir []int) int

+ func (tr *SAvlTree) SearchRange(v Value, work_path []int) (vc Value, vl Value, vr Value)

+ func (tree *SAvlTree) AddNode(root int, v Value) (new_root, new_deeper int)

+ func (tree *SAvlTree) InitSAvlNode(v Value) int

type Set

+ func LoadSet(fload io.Reader) (set *Set)

v1.3.0

Sep 14, 2022

Changes in this version

+ func IndexBArray1D(data []byte, size []int) []byte

+ func IndexBArray2D(data []byte, size []int) [][]byte

+ func IndexBArray3D(data []byte, size []int) [][][]byte

+ func IndexBArray4D(data []byte, size []int) [][][][]byte

+ func IndexBArray5D(data []byte, size []int) [][][][][]byte

+ func IndexIArray1D(data []int, size []int) []int

+ func IndexIArray2D(data []int, size []int) [][]int

+ func IndexIArray3D(data []int, size []int) [][][]int

+ func IndexIArray4D(data []int, size []int) [][][][]int

+ func IndexIArray5D(data []int, size []int) [][][][][]int

+ type DirGraph struct

+ Edge *LinkMat

+ Node *LinkSet

+ func InitDirGraph(size int) *DirGraph

+ func LoadDirGraph(fin io.Reader) *DirGraph

+ func (dg *DirGraph) AddEdge(i1, i2 int)

+ func (dg *DirGraph) AddNode(inode int)

+ func (dg *DirGraph) Expand(size int)

+ func (dg *DirGraph) GetSize() int

+ func (dg *DirGraph) GetUnuseIndex() int

+ func (dg *DirGraph) RemoveEdge(i1, i2 int)

+ func (dg *DirGraph) RemoveNode(inode int)

+ func (dg *DirGraph) Save(fout io.Writer)

type LinkMat

+ func InverseLinkMat(lm *LinkMat) (lm1 *LinkMat)

+ func LoadLinkMat(fin io.Reader) *LinkMat

+ func (lm *LinkMat) GetSize() int

+ func (lm *LinkMat) Save(fout io.Writer)

type LinkSet

+ func InverseLinkSet(ls *LinkSet) (ls_inv *LinkSet)

+ func LoadLinkSet(fin io.Reader) *LinkSet

+ func (ls *LinkSet) GetSize() int

+ func (ls *LinkSet) Save(fout io.Writer)

v1.2.0

Mar 31, 2022

Changes in this version

+ func IndexArray1D(data []float64, size []int) []float64

+ func IndexArray2D(data []float64, size []int) [][]float64

+ func IndexArray3D(data []float64, size []int) [][][]float64

+ func IndexArray4D(data []float64, size []int) [][][][]float64

+ func IndexArray5D(data []float64, size []int) [][][][][]float64

+ func LocToInd(size []int, loc []int) int

+ func TotalSize(size []int) int

type AvlNode

+ func (root *AvlNode) FindLeftNeighbour() *AvlNode

+ func (root *AvlNode) FindRightNeighbour() *AvlNode

+ func (root *AvlNode) Search(v Value) (dir []int)

type AvlTree

+ func (tr *AvlTree) FollowPath(path []int) *AvlNode

+ func (tr *AvlTree) Search(v Value) (dir []int)

+ func (tr *AvlTree) SearchRange(v Value) (vc Value, vl Value, vr Value)

+ type DAG struct

+ func InitDAG(nn int) *DAG

+ func (dag *DAG) AddLink(parent, child int)

+ func (dag *DAG) HasChild(parent int) bool

+ func (dag *DAG) HasParent(child int) bool

+ func (dag *DAG) PopHead() int

+ type LListD []Value

+ func InitLListD() *LListD

+ func (ll *LListD) Flush()

+ func (ll *LListD) Get(ind int) (value *Value)

+ func (ll *LListD) GetFirst() (value *Value)

+ func (ll *LListD) GetLast() (value *Value)

+ func (ll *LListD) GetN() int

+ func (ll *LListD) Pop() (value Value)

+ func (ll *LListD) PopFirst() (value Value)

+ func (ll *LListD) Push(value Value)

+ type LinkMat struct

+ func InitLinkMat(size int) *LinkMat

+ func (lm *LinkMat) Clear()

+ func (lm *LinkMat) ColTraverseForward()

+ func (lm *LinkMat) ColTraverseStart(col int)

+ func (lm *LinkMat) DoubleTraverseForward()

+ func (lm *LinkMat) DoubleTraverseStart(id int)

+ func (lm *LinkMat) Expand(size int)

+ func (lm *LinkMat) GetColNum(col int) int

+ func (lm *LinkMat) GetColTraverseLabel() (row, col int)

+ func (lm *LinkMat) GetDoubleTraverseLabel() (row, col int)

+ func (lm *LinkMat) GetLabel(row, col int) bool

+ func (lm *LinkMat) GetNum() int

+ func (lm *LinkMat) GetRowNum(row int) int

+ func (lm *LinkMat) GetRowTraverseLabel() (row, col int)

+ func (lm *LinkMat) GetTraverseLabel() (row, col int)

+ func (lm *LinkMat) RowTraverseForward()

+ func (lm *LinkMat) RowTraverseStart(row int)

+ func (lm *LinkMat) Set(row int, col int)

+ func (lm *LinkMat) TraverseForward()

+ func (lm *LinkMat) TraverseStart()

+ func (lm *LinkMat) UnSet(row int, col int)

+ type LinkSet struct

+ func InitLinkSet(size int) *LinkSet

+ func (ls *LinkSet) Clear()

+ func (ls *LinkSet) Expand(size int)

+ func (ls *LinkSet) GetLabel(ind int) bool

+ func (ls *LinkSet) GetNum() int

+ func (ls *LinkSet) GetTraverseLabel() int

+ func (ls *LinkSet) Set(ind int)

+ func (ls *LinkSet) TraverseBackward()

+ func (ls *LinkSet) TraverseEnd()

+ func (ls *LinkSet) TraverseForward()

+ func (ls *LinkSet) TraverseStart()

+ func (ls *LinkSet) UnSet(ind int)

v1.0.0

Jan 19, 2022

Changes in this version

+ func Float64CompFunc(v1 Value, v2 Value) int

+ func FloatHeapSort(data []Value)

+ func HeapSort(data []Value, cmf CompFunc)

+ func IntCompFunc(v1 Value, v2 Value) int

+ func IntHeapSort(data []Value)

+ type AvlNode struct

+ func InitAvlNode(v Value, comp_func CompFunc) *AvlNode

+ func (root *AvlNode) Add(v Value) (new_root *AvlNode, new_deeper int)

+ func (root *AvlNode) BalanceLeft() *AvlNode

+ func (root *AvlNode) BalanceRight() *AvlNode

+ func (root *AvlNode) GetHeight() int

+ func (root *AvlNode) Print(level int)

+ func (root *AvlNode) Remove(v Value) (new_root *AvlNode, junk *AvlNode)

+ func (root *AvlNode) RemoveLeftMostDescendant() (new_root *AvlNode, junk *AvlNode)

+ func (root *AvlNode) RestoreLeftBalance(oldbf int) *AvlNode

+ func (root *AvlNode) RestoreRightBalance(oldbf int) *AvlNode

+ type AvlTree struct

+ func InitAvlTree(comp_func CompFunc) *AvlTree

+ func InitFloatAvlTree() *AvlTree

+ func InitIntAvlTree() *AvlTree

+ func (tr *AvlTree) Add(v Value)

+ func (tr *AvlTree) Print()

+ func (tr *AvlTree) Remove(v Value)

+ type Chain struct

+ type CompFunc func(v1 Value, v2 Value) int

+ type Hash struct

+ func InitHash(n int, ktoi KeyToIndexFunc, comp CompFunc) *Hash

+ func InitTreeHash(n []int, ktoi KeyToIndexFunc, comp CompFunc) *Hash

+ func (hash *Hash) AddData(key Value, value Value)

+ func (hash *Hash) Clear()

+ func (hash *Hash) GotoChain(ind []int) *Chain

+ func (hash *Hash) InitSubHash(ind []int, n int)

+ func (hash *Hash) RemoveData(key Value)

+ func (hash *Hash) Search(key Value) (value Value)

+ func (hash *Hash) SearchChain(key Value) *Chain

+ func (hash *Hash) SearchNode(key Value) (last *Node, pcc *Chain, result *Node)

+ type Heap struct

+ func InitFloatHeap() *Heap

+ func InitHeap(cmf CompFunc) *Heap

+ func InitIntHeap() *Heap

+ func (hp *Heap) Add(value Value)

+ func (hp *Heap) Get(ind int) *Value

+ func (hp *Heap) GetLCInd(ind int) int

+ func (hp *Heap) GetParInd(ind int) int

+ func (hp *Heap) GetRCInd(ind int) int

+ func (hp *Heap) GetSize() int

+ func (hp *Heap) Pop() (value Value)

+ func (hp *Heap) Rebuild(root int)

+ type Key interface

+ type KeyToIndexFunc func(key Key) (ind []int)

+ type LList struct

+ func InitLList(nbuf int) *LList

+ func (ll *LList) Flush()

+ func (ll *LList) Get(ind int) (value *Value)

+ func (ll *LList) GetFirst() (value *Value)

+ func (ll *LList) GetLast() (value *Value)

+ func (ll *LList) GetN() int

+ func (ll *LList) Pop() (value Value)

+ func (ll *LList) PopFirst() (value Value)

+ func (ll *LList) Push(value Value) int

+ type Node struct

+ type PQueue Heap

+ func InitPQueue(cmf CompFunc) *PQueue

+ func (pq *PQueue) Add(value Value)

+ func (pq *PQueue) Flush()

+ func (pq *PQueue) GetSize() int

+ func (pq *PQueue) Pop() (value Value)

+ type Set struct

+ func InitSet(size int) *Set

+ func (oset *Set) CopyFrom(sset *Set) (is_err bool)

+ func (s1 *Set) Empty()

+ func (s1 *Set) Full()

+ func (set *Set) GetAllLabel() (labels []int)

+ func (set *Set) GetLabel(ind int) bool

+ func (set *Set) GetNLabel() int

+ func (set *Set) GetSize() int

+ func (set *Set) IsEmpty() bool

+ func (set *Set) Load(fload io.Reader)

+ func (set *Set) Save(fsav io.Writer)

+ func (set *Set) SetLabel(ind int, label bool)

+ func (sres *Set) Co(s1 *Set)

+ func (sres *Set) Diff(s1 *Set, s2 *Set)

+ func (sres *Set) Inter(s1 *Set, s2 *Set)

+ func (sres *Set) Union(s1 *Set, s2 *Set)

+ type Value interface

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL