Functions — github.com/amit-davidson/Building-a-NoSQL-database-from-zero

hub / github.com/amit-davidson/Building-a-NoSQL-database-from-zero / functions

Functions318 in github.com/amit-davidson/Building-a-NoSQL-database-from-zero

⨍ Functions 318◇ Types & classes 56

↓ 1 callersFunctionnewDal

(path string, options *Options)

Part 5/dal.go:38

↓ 1 callersFunctionnewDal

(path string, options *Options)

Part 6/dal.go:38

↓ 1 callersFunctionnewDal

(path string, options *Options)

Part 4/dal.go:38

↓ 1 callersFunctionnewDal

(path string)

Part 3/dal.go:24

↓ 1 callersFunctionnewFreelist

()

Part 1/freelist.go:18

↓ 1 callersFunctionnewItem

(key []byte, value []byte)

Part 3/node.go:25

↓ 1 callersMethodreadFreelist

()

Part 7/dal.go:201

↓ 1 callersMethodreadFreelist

()

Part 2/dal.go:108

↓ 1 callersMethodreadFreelist

()

Part 5/dal.go:210

↓ 1 callersMethodreadFreelist

()

Part 6/dal.go:201

↓ 1 callersMethodreadFreelist

()

Part 4/dal.go:210

↓ 1 callersMethodreadFreelist

()

Part 3/dal.go:141

↓ 1 callersMethodreadMeta

()

Part 7/dal.go:237

↓ 1 callersMethodreadMeta

()

Part 2/dal.go:144

↓ 1 callersMethodreadMeta

()

Part 5/dal.go:246

↓ 1 callersMethodreadMeta

()

Part 6/dal.go:237

↓ 1 callersMethodreadMeta

()

Part 4/dal.go:246

↓ 1 callersMethodreadMeta

()

Part 3/dal.go:177

↓ 1 callersMethodrebalanceRemove

rebalanceRemove rebalances the tree after a remove operation. This can be either by rotating to the right, to the left or by merging. First, the sibli

Part 7/node.go:331

↓ 1 callersMethodrebalanceRemove

rebalanceRemove rebalances the tree after a remove operation. This can be either by rotating to the right, to the left or by merging. First, the sibli

Part 5/node.go:331

↓ 1 callersMethodrebalanceRemove

rebalanceRemove rebalances the tree after a remove operation. This can be either by rotating to the right, to the left or by merging. First, the sibli

Part 6/node.go:331

↓ 1 callersMethodreleasePage

(page pgnum)

Part 2/freelist.go:38

↓ 1 callersMethodreleasePage

(page pgnum)

Part 5/freelist.go:38

↓ 1 callersMethodreleasePage

(page pgnum)

Part 4/freelist.go:38

↓ 1 callersMethodreleasePage

(page pgnum)

Part 3/freelist.go:38

↓ 1 callersMethodremoveItemFromInternal

(index int)

Part 7/node.go:381

↓ 1 callersMethodremoveItemFromInternal

(index int)

Part 5/node.go:381

↓ 1 callersMethodremoveItemFromInternal

(index int)

Part 6/node.go:381

↓ 1 callersMethodremoveItemFromLeaf

removeItemFromLeaf removes an item from a leaf node. It means there is no handling of child nodes.

Part 7/node.go:376

↓ 1 callersMethodremoveItemFromLeaf

removeItemFromLeaf removes an item from a leaf node. It means there is no handling of child nodes.

Part 5/node.go:376

↓ 1 callersMethodremoveItemFromLeaf

removeItemFromLeaf removes an item from a leaf node. It means there is no handling of child nodes.

Part 6/node.go:376

↓ 1 callersFunctionrotateLeft

(aNode, pNode, bNode *Node, bNodeIndex int)

Part 7/node.go:447

↓ 1 callersFunctionrotateLeft

(aNode, pNode, bNode *Node, bNodeIndex int)

Part 5/node.go:447

↓ 1 callersFunctionrotateLeft

(aNode, pNode, bNode *Node, bNodeIndex int)

Part 6/node.go:447

↓ 1 callersFunctionrotateRight

(aNode, pNode, bNode *Node, bNodeIndex int)

Part 7/node.go:417

↓ 1 callersFunctionrotateRight

(aNode, pNode, bNode *Node, bNodeIndex int)

Part 5/node.go:417

↓ 1 callersFunctionrotateRight

(aNode, pNode, bNode *Node, bNodeIndex int)

Part 6/node.go:417

↓ 1 callersMethodwriteFreelist

()

Part 4/dal.go:221

↓ 1 callersMethodwriteFreelist

()

Part 3/dal.go:152

↓ 1 callersMethodwriteMeta

(meta *meta)

Part 7/dal.go:225

↓ 1 callersMethodwriteMeta

(meta *meta)

Part 2/dal.go:132

↓ 1 callersMethodwriteMeta

(meta *meta)

Part 5/dal.go:234

↓ 1 callersMethodwriteMeta

(meta *meta)

Part 6/dal.go:225

↓ 1 callersMethodwriteMeta

(meta *meta)

Part 4/dal.go:234

↓ 1 callersMethodwriteMeta

(meta *meta)

Part 3/dal.go:165

↓ 1 callersMethodwriteNode

(n *Node)

Part 7/dal.go:179

↓ 1 callersMethodwriteNode

(n *Node)

Part 6/dal.go:179

↓ 1 callersMethodwriteNode

(node *Node)

Part 3/node.go:36

↓ 1 callersMethodwriteNodes

(nodes ...*Node)

Part 4/node.go:57

↓ 1 callersMethodwritePage

MethodDeleteCollection

(name []byte)

Part 7/tx.go:142

MethodFind

Find Returns an item according based on the given key by performing a binary search.

Part 6/collection.go:94

MethodID

()

Part 7/collection.go:29

FunctionOpen

(path string, options *Options)

Part 6/db.go:13

MethodPut

Put adds a key to the tree. It finds the correct node and the insertion index and adds the item. When performing the search, the ancestors are returne

Part 6/collection.go:24

Remove removes a key from the tree. It finds the correct node and the index to remove the item from and removes it. When performing the search, the an

Part 6/collection.go:115

MethodcanSpareAnElement

canSpareAnElement checks if the node size is big enough to populate a page after giving away one item.

Part 7/collection.go:49

Part 7/freelist.go:60

Methoddeserialize

(buf []byte)

Part 2/freelist.go:60

Methoddeserialize

(buf []byte)

Part 1/freelist.go:61

Part 5/freelist.go:60

Part 6/freelist.go:60

Part 4/freelist.go:60

Part 3/freelist.go:60

(index int, parentNode *Node)

Part 4/node.go:40

MethodisOverPopulated

isOverPopulated checks if the node size is bigger than the size of a page.

Part 7/node.go:68

MethodisOverPopulated

isOverPopulated checks if the node size is bigger than the size of a page.

Part 5/node.go:68

MethodisOverPopulated

isOverPopulated checks if the node size is bigger than the size of a page.

Part 6/node.go:68

MethodisOverPopulated

isOverPopulated checks if the node size is bigger than the size of a page.

Part 4/node.go:68

MethodisUnderPopulated

isUnderPopulated checks if the node size is smaller than the size of a page.

Part 7/node.go:82

MethodisUnderPopulated

isUnderPopulated checks if the node size is smaller than the size of a page.

Part 5/node.go:82

MethodisUnderPopulated

isUnderPopulated checks if the node size is smaller than the size of a page.

Part 6/node.go:82

MethodisUnderPopulated

isUnderPopulated checks if the node size is smaller than the size of a page.

Part 4/node.go:82

MethodisUnderPopulated

FunctionnewCollection

(name []byte, root pgnum)

Part 7/collection.go:18

← previous next →201–300 of 318, ranked by callers