diff options
author | Ben Johnson <benbjohnson@yahoo.com> | 2014-04-04 12:04:53 -0600 |
---|---|---|
committer | Ben Johnson <benbjohnson@yahoo.com> | 2014-04-04 12:04:53 -0600 |
commit | 3f7dbffa2e75f859efbc391d0e6a2a2955a84fcb (patch) | |
tree | 8cfb509c6e5c4bbc60f5ae4c036644342dbac899 /cursor.go | |
parent | Merge pull request #118 from benbjohnson/commit-hook (diff) | |
parent | Rename internal local Tx variables. (diff) | |
download | dedo-3f7dbffa2e75f859efbc391d0e6a2a2955a84fcb.tar.gz dedo-3f7dbffa2e75f859efbc391d0e6a2a2955a84fcb.tar.xz |
Merge pull request #119 from benbjohnson/tx-rename
Rename internal local Tx variables.
Diffstat (limited to 'cursor.go')
-rw-r--r-- | cursor.go | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -259,7 +259,7 @@ func (c *Cursor) keyValue() ([]byte, []byte) { } // node returns the node that the cursor is currently positioned on. -func (c *Cursor) node(t *Tx) *node { +func (c *Cursor) node(tx *Tx) *node { _assert(len(c.stack) > 0, "accessing a node with a zero-length cursor stack") // If the top of the stack is a leaf node then just return it. @@ -270,7 +270,7 @@ func (c *Cursor) node(t *Tx) *node { // Start from root and traverse down the hierarchy. var n = c.stack[0].node if n == nil { - n = t.node(c.stack[0].page.id, nil) + n = tx.node(c.stack[0].page.id, nil) } for _, ref := range c.stack[:len(c.stack)-1] { _assert(!n.isLeaf, "expected branch node") |