btree

Documentation

Index

• Constants
• type BTree
  • func New(degree int) *BTree
  • func NewWithFreeList(degree int, f *FreeList) *BTree
• type FreeList
  • func NewFreeList(size int) *FreeList
• type Item
• type ItemIterator

Constants

const (
	DefaultFreeListSize = 32
)

Types

type BTree

type BTree struct {
	// contains filtered or unexported fields
}

func New

func New(degree int) *BTree

func NewWithFreeList

func NewWithFreeList(degree int, f *FreeList) *BTree

type FreeList

type FreeList struct {
	// contains filtered or unexported fields
}

------------- FreeList ------------- FreeList 空间表，一种特定动态内存分配方案的数据结构。它通过指针把固定大小内存块组织成内存池，当需要内存分配的时候，优先从空间表中分配。 从而，避免频繁的内存分配。使用场景也很明显，就是频繁发生内存分配的场景。

func NewFreeList

func NewFreeList(size int) *FreeList

type Item

type Item interface {
	Less(than Item) bool
}

type ItemIterator

type ItemIterator func(i Item) bool