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

↓ 8 callersMethodClose

()

Part 7/db.go:28

↓ 8 callersMethodisLeaf

()

Part 7/node.go:49

↓ 8 callersMethodisLeaf

()

Part 5/node.go:48

↓ 8 callersMethodisLeaf

()

Part 6/node.go:49

↓ 7 callersMethodgetNode

(pageNum pgnum)

Part 7/node.go:63

↓ 7 callersMethodgetNode

(pageNum pgnum)

Part 5/node.go:63

↓ 7 callersMethodgetNode

(pageNum pgnum)

Part 6/node.go:63

↓ 6 callersMethodPut

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 5/collection.go:23

↓ 6 callersMethodPut

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 4/collection.go:23

↓ 5 callersMethodallocateEmptyPage

()

Part 2/dal.go:85

↓ 5 callersMethodgetNode

(pageNum pgnum)

Part 7/tx.go:36

↓ 5 callersMethodgetNode

(pageNum pgnum)

Part 5/dal.go:176

↓ 5 callersMethodgetNode

(pageNum pgnum)

Part 6/tx.go:36

↓ 5 callersMethodwriteNode

(node *Node)

Part 7/tx.go:49

↓ 5 callersMethodwriteNodes

(nodes ...*Node)

Part 7/node.go:57

↓ 5 callersMethodwriteNodes

(nodes ...*Node)

Part 5/node.go:57

↓ 5 callersMethodwriteNodes

(nodes ...*Node)

Part 6/node.go:57

↓ 4 callersMethodallocateEmptyPage

()

Part 7/dal.go:144

↓ 4 callersMethodallocateEmptyPage

()

Part 5/dal.go:144

↓ 4 callersMethodallocateEmptyPage

()

Part 6/dal.go:144

↓ 4 callersMethodallocateEmptyPage

()

Part 4/dal.go:144

↓ 4 callersMethodallocateEmptyPage

()

Part 3/dal.go:85

↓ 4 callersMethoddeserialize

(buf []byte)

Part 7/node.go:156

↓ 4 callersMethodgetNextPage

getNextPage returns page ids for writing New page ids are first given from the releasedPageIDs to avoid growing the file. If it's empty, then maxPage

Part 2/freelist.go:27

↓ 4 callersMethodgetNode

(pageNum pgnum)

Part 4/dal.go:176

↓ 4 callersMethodnewNode

(items []*Item, childNodes []pgnum)

Part 7/tx.go:25

↓ 4 callersMethodnewNode

(items []*Item, childNodes []pgnum)

Part 5/dal.go:167

↓ 4 callersMethodnewNode

(items []*Item, childNodes []pgnum)

Part 6/tx.go:25

↓ 4 callersMethodnewNode

(items []*Item, childNodes []pgnum)

Part 4/dal.go:167

↓ 4 callersMethodserialize

(buf []byte)

Part 7/node.go:86

↓ 4 callersMethodwriteNode

(node *Node)

Part 7/node.go:53

↓ 4 callersMethodwriteNode

(node *Node)

Part 5/node.go:52

↓ 4 callersMethodwriteNode

(n *Node)

Part 5/dal.go:188

↓ 4 callersMethodwriteNode

(node *Node)

Part 6/node.go:53

↓ 4 callersMethodwriteNode

(node *Node)

Part 6/tx.go:49

↓ 4 callersMethodwriteNode

(n *Node)

Part 4/dal.go:188

↓ 4 callersMethodwritePage

(p *page)

Part 2/dal.go:102

↓ 3 callersFunctionNewEmptyNode

()

Part 7/node.go:22

↓ 3 callersMethodclose

()

Part 7/dal.go:132

↓ 3 callersMethodclose

()

Part 2/dal.go:73

↓ 3 callersMethodclose

()

Part 5/dal.go:132

↓ 3 callersMethodclose

()

Part 6/dal.go:132

↓ 3 callersMethodclose

()

Part 4/dal.go:132

↓ 3 callersMethodclose

()

Part 3/dal.go:73

↓ 3 callersMethoddeserialize

(buf []byte)

Part 5/node.go:156

↓ 3 callersMethoddeserialize

(buf []byte)

Part 6/node.go:156

↓ 3 callersMethoddeserialize

(buf []byte)

Part 4/node.go:156

↓ 3 callersMethoddeserialize

(buf []byte)

Part 3/node.go:121

↓ 3 callersMethodfindKey

findKey searches for a key inside the tree. Once the key is found, the parent node and the correct index are returned so the key itself can be accesse

Part 7/node.go:230

↓ 3 callersMethodfindKey

findKey searches for a key inside the tree. Once the key is found, the parent node and the correct index are returned so the key itself can be accesse

Part 5/node.go:230

↓ 3 callersMethodfindKey

findKey searches for a key inside the tree. Once the key is found, the parent node and the correct index are returned so the key itself can be accesse

Part 6/node.go:230

↓ 3 callersMethodgetNextPage

getNextPage returns page ids for writing New page ids are first given from the releasedPageIDs to avoid growing the file. If it's empty, then maxPage

Part 7/freelist.go:27

↓ 3 callersMethodgetNextPage

getNextPage returns page ids for writing New page ids are first given from the releasedPageIDs to avoid growing the file. If it's empty, then maxPage

Part 5/freelist.go:27

↓ 3 callersMethodgetNextPage

getNextPage returns page ids for writing New page ids are first given from the releasedPageIDs to avoid growing the file. If it's empty, then maxPage

Part 6/freelist.go:27

↓ 3 callersMethodgetNextPage

getNextPage returns page ids for writing New page ids are first given from the releasedPageIDs to avoid growing the file. If it's empty, then maxPage

Part 4/freelist.go:27

↓ 3 callersMethodgetRootCollection

()

Part 7/tx.go:102

↓ 3 callersMethodisLeaf

()

Part 4/node.go:48

↓ 3 callersFunctionnewEmptyCollection

()

Part 7/collection.go:25

↓ 3 callersFunctionnewItem

(key []byte, value []byte)

Part 7/node.go:34

↓ 3 callersMethodreadPage

(pageNum pgnum)

Part 7/dal.go:150

↓ 3 callersMethodreadPage

(pageNum pgnum)

Part 5/dal.go:150

↓ 3 callersMethodreadPage

(pageNum pgnum)

Part 6/dal.go:150

↓ 3 callersMethodreadPage

(pageNum pgnum)

Part 4/dal.go:150

↓ 3 callersMethodreadPage

(pageNum pgnum)

Part 3/dal.go:124

↓ 3 callersMethodserialize

(buf []byte)

Part 5/node.go:86

↓ 3 callersMethodserialize

(buf []byte)

Part 6/node.go:86

↓ 3 callersMethodserialize

(buf []byte)

Part 4/node.go:86

↓ 3 callersMethodserialize

(buf []byte)

Part 3/node.go:51

↓ 3 callersMethodwriteFreelist

()

Part 2/dal.go:119

↓ 3 callersMethodwriteNode

(node *Node)

Part 4/node.go:52

↓ 3 callersMethodwritePage

(p *page)

Part 7/dal.go:161

↓ 3 callersMethodwritePage

(p *page)

Part 5/dal.go:161

↓ 3 callersMethodwritePage

(p *page)

Part 6/dal.go:161

↓ 3 callersMethodwritePage

(p *page)

Part 4/dal.go:161

↓ 3 callersMethodwritePage

(p *page)

Part 3/dal.go:135

↓ 2 callersMethodCommit

()

Part 7/tx.go:74

↓ 2 callersMethodFind

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

Part 7/collection.go:133

↓ 2 callersMethodFind

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

Part 5/collection.go:92

↓ 2 callersFunctionNewEmptyNode

()

Part 5/node.go:21

↓ 2 callersFunctionNewEmptyNode

()

Part 6/node.go:22

↓ 2 callersFunctionNewEmptyNode

()

Part 4/node.go:21

↓ 2 callersFunctionOpen

(path string, options *Options)

Part 7/db.go:13

↓ 2 callersMethodPut

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 7/collection.go:66

↓ 2 callersMethodaddItem

(item *Item, insertionIndex int)

Part 7/node.go:279

↓ 2 callersMethodaddItem

(item *Item, insertionIndex int)

Part 5/node.go:279

↓ 2 callersMethodaddItem

(item *Item, insertionIndex int)

Part 6/node.go:279

↓ 2 callersMethodaddItem

(item *Item, insertionIndex int)

Part 4/node.go:279

↓ 2 callersMethodallocateEmptyPage

()

Part 1/dal.go:47

↓ 2 callersMethodcanSpareAnElement

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

Part 7/node.go:73

↓ 2 callersMethodcanSpareAnElement

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

Part 5/node.go:73

↓ 2 callersMethodcanSpareAnElement

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

Part 6/node.go:73

↓ 2 callersMethoddeleteNode

(node *Node)

Part 7/tx.go:55

↓ 2 callersMethoddeleteNode

(node *Node)

Part 6/tx.go:55

↓ 2 callersMethoddeserialize

(buf []byte)

Part 2/meta.go:25

↓ 2 callersMethodelementSize

elementSize returns the size of a key-value-childNode triplet at a given index. If the node is a leaf, then the size of a key-value pair is returned.

Part 7/node.go:202

↓ 2 callersMethodelementSize

elementSize returns the size of a key-value-childNode triplet at a given index. If the node is a leaf, then the size of a key-value pair is returned.

Part 5/node.go:202

↓ 2 callersMethodelementSize

elementSize returns the size of a key-value-childNode triplet at a given index. If the node is a leaf, then the size of a key-value pair is returned.

Part 6/node.go:202

↓ 2 callersMethodelementSize

elementSize returns the size of a key-value-childNode triplet at a given index. If the node is a leaf, then the size of a key-value pair is returned.

Part 4/node.go:202

↓ 2 callersMethodfindKey

findKey searches for a key inside the tree. Once the key is found, the parent node and the correct index are returned so the key itself can be accesse

Part 4/node.go:230

↓ 2 callersMethodgetNextPage

getNextPage returns page ids for writing New page ids are first given from the releasedPageIDs to avoid growing the file. If it's empty, then maxPage

Part 3/freelist.go:27

next →1–100 of 318, ranked by callers