org.apache.activemq.store.kahadb.disk.index
Interface BTreeVisitor<Key,Value>

Type Parameters:
Key -
Value -
All Known Implementing Classes:
BTreeVisitor.AndVisitor, BTreeVisitor.BetweenVisitor, BTreeVisitor.GTEVisitor, BTreeVisitor.GTVisitor, BTreeVisitor.LTEVisitor, BTreeVisitor.LTVisitor, BTreeVisitor.OrVisitor, BTreeVisitor.PredicateVisitor

public interface BTreeVisitor<Key,Value>

Interface used to selectively visit the entries in a BTree.


Nested Class Summary
static class BTreeVisitor.AndVisitor<Key,Value>
           
static class BTreeVisitor.BetweenVisitor<Key extends Comparable<Key>,Value>
           
static class BTreeVisitor.GTEVisitor<Key extends Comparable<Key>,Value>
           
static class BTreeVisitor.GTVisitor<Key extends Comparable<Key>,Value>
           
static class BTreeVisitor.LTEVisitor<Key extends Comparable<Key>,Value>
           
static class BTreeVisitor.LTVisitor<Key extends Comparable<Key>,Value>
           
static class BTreeVisitor.OrVisitor<Key,Value>
           
static interface BTreeVisitor.Predicate<Key>
           
static class BTreeVisitor.PredicateVisitor<Key,Value>
           
 
Method Summary
 boolean isInterestedInKeysBetween(Key first, Key second)
          Do you want to visit the range of BTree entries between the first and and second key?
 void visit(List<Key> keys, List<Value> values)
          The keys and values of a BTree leaf node.
 

Method Detail

isInterestedInKeysBetween

boolean isInterestedInKeysBetween(Key first,
                                  Key second)
Do you want to visit the range of BTree entries between the first and and second key?

Parameters:
first - if null indicates the range of values before the second key.
second - if null indicates the range of values after the first key.
Returns:
true if you want to visit the values between the first and second key.

visit

void visit(List<Key> keys,
           List<Value> values)
The keys and values of a BTree leaf node.

Parameters:
keys -
values -


Copyright © 2005–2013 The Apache Software Foundation. All rights reserved.