Uses of Class
org.apache.activemq.store.kahadb.disk.page.Transaction

Packages that use Transaction
org.apache.activemq.store.kahadb   
org.apache.activemq.store.kahadb.disk.index   
org.apache.activemq.store.kahadb.disk.page   
 

Uses of Transaction in org.apache.activemq.store.kahadb
 

Methods in org.apache.activemq.store.kahadb with parameters of type Transaction
protected  org.apache.activemq.store.kahadb.MessageDatabase.StoredDestination MessageDatabase.getExistingStoredDestination(KahaDestination destination, Transaction tx)
           
 org.apache.activemq.store.kahadb.MessageDatabase.LastAck MessageDatabase.getLastAck(Transaction tx, org.apache.activemq.store.kahadb.MessageDatabase.StoredDestination sd, String subscriptionKey)
           
protected  org.apache.activemq.store.kahadb.TempMessageDatabase.StoredDestination TempMessageDatabase.getStoredDestination(KahaDestination destination, Transaction tx)
           
protected  org.apache.activemq.store.kahadb.MessageDatabase.StoredDestination MessageDatabase.getStoredDestination(KahaDestination destination, Transaction tx)
           
 long MessageDatabase.getStoredMessageCount(Transaction tx, org.apache.activemq.store.kahadb.MessageDatabase.StoredDestination sd, String subscriptionKey)
           
protected  void MessageDatabase.recoverIndex(Transaction tx)
           
 

Uses of Transaction in org.apache.activemq.store.kahadb.disk.index
 

Methods in org.apache.activemq.store.kahadb.disk.index with parameters of type Transaction
 Value ListIndex.add(Transaction tx, Key key, Value value)
           
 Value ListNode.addFirst(Transaction tx, Key key, Value value)
           
 Value ListIndex.addFirst(Transaction tx, Key key, Value value)
           
 void ListNode.clear(Transaction tx)
           
 void ListIndex.clear(Transaction tx)
           
 void Index.clear(Transaction tx)
          clear the index
 void HashIndex.clear(Transaction tx)
           
 void BTreeNode.clear(Transaction tx)
           
 void BTreeIndex.clear(Transaction tx)
           
 boolean ListNode.contains(Transaction tx, Key key)
           
 boolean BTreeNode.contains(Transaction tx, Key key)
           
 boolean ListIndex.containsKey(Transaction tx, Key key)
           
 boolean Index.containsKey(Transaction tx, Key key)
           
 boolean HashIndex.containsKey(Transaction tx, Key key)
           
 boolean BTreeIndex.containsKey(Transaction tx, Key key)
           
 ListNode<Key,Value> ListIndex.createNode(Transaction tx)
           
 Value ListNode.get(Transaction tx, Key key)
           
 Value ListIndex.get(Transaction tx, Key key)
           
 Value Index.get(Transaction tx, Key key)
           
 Value HashIndex.get(Transaction tx, Key key)
           
 Value BTreeNode.get(Transaction tx, Key key)
           
 Value BTreeIndex.get(Transaction tx, Key key)
           
 Map.Entry<Key,Value> ListNode.getFirst(Transaction tx)
           
 Map.Entry<Key,Value> ListIndex.getFirst(Transaction tx)
           
 Map.Entry<Key,Value> BTreeNode.getFirst(Transaction tx)
           
 Map.Entry<Key,Value> BTreeIndex.getFirst(Transaction tx)
           
 BTreeNode<Key,Value> BTreeNode.getFirstLeafNode(Transaction tx)
           
protected  ListNode<Key,Value> ListIndex.getHead(Transaction tx)
           
 Map.Entry<Key,Value> ListNode.getLast(Transaction tx)
           
 Map.Entry<Key,Value> ListIndex.getLast(Transaction tx)
           
 Map.Entry<Key,Value> BTreeNode.getLast(Transaction tx)
           
 Map.Entry<Key,Value> BTreeIndex.getLast(Transaction tx)
           
 int BTreeIndex.getMaxLeafDepth(Transaction tx)
           
 int BTreeNode.getMaxLeafDepth(Transaction tx, int depth)
           
 int BTreeIndex.getMinLeafDepth(Transaction tx)
           
 int BTreeNode.getMinLeafDepth(Transaction tx, int depth)
           
protected  ListNode<Key,Value> ListIndex.getTail(Transaction tx)
           
 boolean ListNode.isEmpty(Transaction tx)
           
 boolean ListIndex.isEmpty(Transaction tx)
           
 boolean BTreeNode.isEmpty(Transaction tx)
           
 boolean BTreeIndex.isEmpty(Transaction tx)
           
 Iterator<Map.Entry<Key,Value>> ListNode.iterator(Transaction tx)
           
 Iterator<Map.Entry<Key,Value>> ListIndex.iterator(Transaction tx)
           
 Iterator<Map.Entry<Key,Value>> Index.iterator(Transaction tx)
           
 Iterator<Map.Entry<Key,Value>> HashIndex.iterator(Transaction tx)
           
 Iterator<Map.Entry<Key,Value>> BTreeNode.iterator(Transaction tx)
           
 Iterator<Map.Entry<Key,Value>> BTreeIndex.iterator(Transaction tx)
           
 Iterator<Map.Entry<Key,Value>> BTreeNode.iterator(Transaction tx, Key startKey)
           
 Iterator<Map.Entry<Key,Value>> BTreeIndex.iterator(Transaction tx, Key initialKey)
           
 Iterator<Map.Entry<Key,Value>> ListNode.iterator(Transaction tx, long pos)
           
 Iterator<Map.Entry<Key,Value>> ListIndex.iterator(Transaction tx, long initialPosition)
           
 Iterator<ListNode<Key,Value>> ListIndex.listNodeIterator(Transaction tx)
           
 void ListIndex.load(Transaction tx)
           
 void Index.load(Transaction tx)
          load indexes
 void HashIndex.load(Transaction tx)
           
 void BTreeIndex.load(Transaction tx)
           
 void BTreeIndex.printStructure(Transaction tx, OutputStream out)
           
 void BTreeIndex.printStructure(Transaction tx, PrintWriter out)
           
 void BTreeNode.printStructure(Transaction tx, PrintWriter out, String prefix)
           
 Value ListNode.put(Transaction tx, Key key, Value value)
           
 Value ListIndex.put(Transaction tx, Key key, Value value)
          Update the value of the item with the given key in the list if ot exists, otherwise it appends the value to the end of the list.
 Value Index.put(Transaction tx, Key key, Value entry)
          store the key, item
 Value HashIndex.put(Transaction tx, Key key, Value value)
           
 Value BTreeNode.put(Transaction tx, Key key, Value value)
           
 Value BTreeIndex.put(Transaction tx, Key key, Value value)
           
 Value ListIndex.remove(Transaction tx, Key key)
           
 Value Index.remove(Transaction tx, Key key)
          remove the index key
 Value HashIndex.remove(Transaction tx, Key key)
           
 Value BTreeNode.remove(Transaction tx, Key key)
           
 Value BTreeIndex.remove(Transaction tx, Key key)
           
 int ListNode.size(Transaction tx)
           
 int HashIndex.size(Transaction tx)
           
 void HashIndex.store(Transaction tx, org.apache.activemq.store.kahadb.disk.index.HashBin<Key,Value> bin)
           
 void ListIndex.storeNode(Transaction tx, ListNode<Key,Value> node, boolean overflow)
           
 void ListNode.storeUpdate(Transaction tx)
           
 void ListIndex.unload(Transaction tx)
           
 void Index.unload(Transaction tx)
          unload indexes
 void HashIndex.unload(Transaction tx)
           
 void BTreeIndex.unload(Transaction tx)
           
 void BTreeNode.visit(Transaction tx, BTreeVisitor<Key,Value> visitor)
           
 void BTreeIndex.visit(Transaction tx, BTreeVisitor<Key,Value> visitor)
           
 

Uses of Transaction in org.apache.activemq.store.kahadb.disk.page
 

Methods in org.apache.activemq.store.kahadb.disk.page that return Transaction
 Transaction PageFile.tx()
           
 

Methods in org.apache.activemq.store.kahadb.disk.page with parameters of type Transaction
 void Transaction.Closure.execute(Transaction tx)
           
 R Transaction.CallableClosure.execute(Transaction tx)
           
 



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