From 8d5757e9dd1891b3d05f7acc7fe3d5a1d664ff6f Mon Sep 17 00:00:00 2001 From: Ben Johnson Date: Thu, 30 Jan 2014 17:04:56 -0500 Subject: gofmt --- leaf.go | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) (limited to 'leaf.go') diff --git a/leaf.go b/leaf.go index be5d447..84cb08d 100644 --- a/leaf.go +++ b/leaf.go @@ -9,7 +9,7 @@ import ( // leaf represents an in-memory, deserialized leaf page. type leaf struct { parent *branch - items leafItems + items leafItems } // size returns the size of the leaf after serialization. @@ -78,7 +78,7 @@ func (l *leaf) write(p *page) { func (l *leaf) split(pageSize int) []*leaf { // Ignore the split if the page doesn't have at least enough nodes for // multiple pages or if the data can fit on a single page. - if len(l.items) <= (minKeysPerPage * 2) || l.size() < pageSize { + if len(l.items) <= (minKeysPerPage*2) || l.size() < pageSize { return []*leaf{l} } @@ -93,7 +93,7 @@ func (l *leaf) split(pageSize int) []*leaf { for index, item := range l.items { nodeSize := lnodeSize + len(item.key) + len(item.value) - if (len(current.items) >= minKeysPerPage && index < len(l.items)-minKeysPerPage && size+nodeSize > threshold) { + if len(current.items) >= minKeysPerPage && index < len(l.items)-minKeysPerPage && size+nodeSize > threshold { size = pageHeaderSize leafs = append(leafs, current) current = &leaf{} @@ -117,4 +117,3 @@ type leafItem struct { func (s leafItems) Len() int { return len(s) } func (s leafItems) Swap(i, j int) { s[i], s[j] = s[j], s[i] } func (s leafItems) Less(i, j int) bool { return bytes.Compare(s[i].key, s[j].key) == -1 } - -- cgit v1.2.3