Documentation
¶
Index ¶
- type DuplexList
- func (m *DuplexList) Clear()
- func (m *DuplexList) Delete(node *Node)
- func (m *DuplexList) DeleteIndex(int)
- func (m *DuplexList) Equals(node *Node)
- func (m *DuplexList) GetAttribute() *C.Attribute
- func (m *DuplexList) Insert(node ...*Node)
- func (m *DuplexList) InsertIndex(index int, nodes ...*Node)
- func (m *DuplexList) Size() int
- func (m *DuplexList) ValueSet() []interface{}
- type LFUCache
- type LRUCache
- type LastKRecursion
- type LastKTwoPoint
- type Node
- type SimplexList
- func (m *SimplexList) Clear()
- func (m *SimplexList) Delete(*Node)
- func (m *SimplexList) DeleteIndex(index int)
- func (m *SimplexList) Equals(*Node)
- func (m *SimplexList) GetAttribute() *C.Attribute
- func (m *SimplexList) Insert(...*Node)
- func (m *SimplexList) InsertIndex(index int, node ...*Node)
- func (m *SimplexList) Size() int
- func (m *SimplexList) ValueSet() []interface{}
- type SkipList
- func (m *SkipList) Clear()
- func (m *SkipList) Delete(node *Node)
- func (m *SkipList) DeleteIndex(index int)
- func (m *SkipList) Equals(node *Node)
- func (m *SkipList) GetAttribute() *C.Attribute
- func (m *SkipList) Insert(node ...*Node)
- func (m *SkipList) InsertIndex(index int, node ...*Node)
- func (m *SkipList) Size() int
- func (m *SkipList) SortMethod(array []int)
- func (m *SkipList) ValueSet() []interface{}
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type DuplexList ¶
type DuplexList struct {
// contains filtered or unexported fields
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/28 17:03
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
func NewDuplexList ¶
func NewDuplexList(options ...C.Options) *DuplexList
func (*DuplexList) Clear ¶
func (m *DuplexList) Clear()
func (*DuplexList) Delete ¶
func (m *DuplexList) Delete(node *Node)
func (*DuplexList) DeleteIndex ¶
func (m *DuplexList) DeleteIndex(int)
func (*DuplexList) Equals ¶
func (m *DuplexList) Equals(node *Node)
func (*DuplexList) GetAttribute ¶
func (m *DuplexList) GetAttribute() *C.Attribute
func (*DuplexList) Insert ¶
func (m *DuplexList) Insert(node ...*Node)
func (*DuplexList) InsertIndex ¶
func (m *DuplexList) InsertIndex(index int, nodes ...*Node)
func (*DuplexList) Size ¶
func (m *DuplexList) Size() int
func (*DuplexList) ValueSet ¶
func (m *DuplexList) ValueSet() []interface{}
type LFUCache ¶
type LFUCache struct {
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/28 17:19
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description 最近最少使用算法
- LFU，Least Frequently Used
- LFU相对于LRU而言，多了一个频率统计 *
func NewLFUCache ¶
func NewLFUCache() *LFUCache
func (*LFUCache) GetAttribute ¶
type LRUCache ¶
type LRUCache struct {
LimitSize int
// contains filtered or unexported fields
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/28 17:19
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description 最近最久未使用算法
- LRU: The Least Recently Used *
func NewLRUCache ¶
func (*LRUCache) GetAttribute ¶
type LastKRecursion ¶
type LastKRecursion struct {
}
*
- @author ljfirst
- @version V1.0
- @date 2023/7/6 23:31
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
func (*LastKRecursion) FindMethod ¶
func (m *LastKRecursion) FindMethod(root *Node, k int) *Node
func (*LastKRecursion) GetAttribute ¶
func (m *LastKRecursion) GetAttribute() *C.Attribute
type LastKTwoPoint ¶
type LastKTwoPoint struct {
}
*
- @author ljfirst
- @version V1.0
- @date 2023/7/6 23:31
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
func (*LastKTwoPoint) FindMethod ¶
func (m *LastKTwoPoint) FindMethod(root *Node, k int) *Node
func (*LastKTwoPoint) GetAttribute ¶
func (m *LastKTwoPoint) GetAttribute() *C.Attribute
type Node ¶
type Node struct {
Key interface{}
Value interface{}
Pre *Node
Next *Node
Left *Node
Right *Node
Parent *Node
Down *Node
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/28 16:43
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
func (*Node) Array2Node ¶
func (*Node) Node2Array ¶
func (*Node) TreeEquals ¶
type SimplexList ¶
type SimplexList struct {
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/28 17:03
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
func (*SimplexList) Clear ¶
func (m *SimplexList) Clear()
func (*SimplexList) Delete ¶
func (m *SimplexList) Delete(*Node)
func (*SimplexList) DeleteIndex ¶
func (m *SimplexList) DeleteIndex(index int)
func (*SimplexList) Equals ¶
func (m *SimplexList) Equals(*Node)
func (*SimplexList) GetAttribute ¶
func (m *SimplexList) GetAttribute() *C.Attribute
func (*SimplexList) Insert ¶
func (m *SimplexList) Insert(...*Node)
func (*SimplexList) InsertIndex ¶
func (m *SimplexList) InsertIndex(index int, node ...*Node)
func (*SimplexList) Size ¶
func (m *SimplexList) Size() int
func (*SimplexList) ValueSet ¶
func (m *SimplexList) ValueSet() []interface{}
type SkipList ¶
type SkipList struct {
FromHighToLow bool // true表示从高到低排序,默认 false 表示从低到高排序
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/28 17:03
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description 跳表 *
func NewSkipList ¶
func NewSkipList() *SkipList
func (*SkipList) DeleteIndex ¶
func (*SkipList) GetAttribute ¶
func (*SkipList) InsertIndex ¶
func (*SkipList) SortMethod ¶
Source Files
Click to show internal directories.
Click to hide internal directories.