Commit 8083e583 authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent 3ae4e927
...@@ -229,7 +229,7 @@ func (b *IOBucket) get(key int32) (interface{}, bool) { ...@@ -229,7 +229,7 @@ func (b *IOBucket) get(key int32) (interface{}, bool) {
// MinKey returns minimum key in IOBTree. // MinKey returns minimum key in IOBTree.
// //
// If the tree is empty, ok=false is returned. // If the tree is empty, ok=false is returned.
// t does not need to be activated beforehand. // The tree does not need to be activated beforehand.
func (t *IOBTree) MinKey(ctx context.Context) (_ int32, ok bool, err error) { func (t *IOBTree) MinKey(ctx context.Context) (_ int32, ok bool, err error) {
defer xerr.Contextf(&err, "btree(%s): minkey", t.POid()) defer xerr.Contextf(&err, "btree(%s): minkey", t.POid())
err = t.PActivate(ctx) err = t.PActivate(ctx)
...@@ -267,7 +267,7 @@ func (t *IOBTree) MinKey(ctx context.Context) (_ int32, ok bool, err error) { ...@@ -267,7 +267,7 @@ func (t *IOBTree) MinKey(ctx context.Context) (_ int32, ok bool, err error) {
// MaxKey returns maximum key in IOBTree. // MaxKey returns maximum key in IOBTree.
// //
// If the tree is empty, ok=false is returned. // If the tree is empty, ok=false is returned.
// t does not need to be activated beforehand. // The tree does not need to be activated beforehand.
func (t *IOBTree) MaxKey(ctx context.Context) (_ int32, _ bool, err error) { func (t *IOBTree) MaxKey(ctx context.Context) (_ int32, _ bool, err error) {
defer xerr.Contextf(&err, "btree(%s): maxkey", t.POid()) defer xerr.Contextf(&err, "btree(%s): maxkey", t.POid())
err = t.PActivate(ctx) err = t.PActivate(ctx)
......
...@@ -229,7 +229,7 @@ func (b *LOBucket) get(key int64) (interface{}, bool) { ...@@ -229,7 +229,7 @@ func (b *LOBucket) get(key int64) (interface{}, bool) {
// MinKey returns minimum key in LOBTree. // MinKey returns minimum key in LOBTree.
// //
// If the tree is empty, ok=false is returned. // If the tree is empty, ok=false is returned.
// t does not need to be activated beforehand. // The tree does not need to be activated beforehand.
func (t *LOBTree) MinKey(ctx context.Context) (_ int64, ok bool, err error) { func (t *LOBTree) MinKey(ctx context.Context) (_ int64, ok bool, err error) {
defer xerr.Contextf(&err, "btree(%s): minkey", t.POid()) defer xerr.Contextf(&err, "btree(%s): minkey", t.POid())
err = t.PActivate(ctx) err = t.PActivate(ctx)
...@@ -267,7 +267,7 @@ func (t *LOBTree) MinKey(ctx context.Context) (_ int64, ok bool, err error) { ...@@ -267,7 +267,7 @@ func (t *LOBTree) MinKey(ctx context.Context) (_ int64, ok bool, err error) {
// MaxKey returns maximum key in LOBTree. // MaxKey returns maximum key in LOBTree.
// //
// If the tree is empty, ok=false is returned. // If the tree is empty, ok=false is returned.
// t does not need to be activated beforehand. // The tree does not need to be activated beforehand.
func (t *LOBTree) MaxKey(ctx context.Context) (_ int64, _ bool, err error) { func (t *LOBTree) MaxKey(ctx context.Context) (_ int64, _ bool, err error) {
defer xerr.Contextf(&err, "btree(%s): maxkey", t.POid()) defer xerr.Contextf(&err, "btree(%s): maxkey", t.POid())
err = t.PActivate(ctx) err = t.PActivate(ctx)
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment