Examples of org.infinispan.tree.Node

org.infinispan.tree.Node
A Node is a {@link Fqn named} logical grouping of data in the {@link TreeCache} API of JBoss {@link Cache}. A node should be used to contain data for a single data record, for example information about a particular person or account.
One purpose of grouping cache data into separate nodes is to minimize transaction locking interference, and increase concurrency. So for example, when multiple threads or possibly distributed caches are acccessing different accounts simultaneously.
A node has references to its children, parent (each node except the root - defined by {@link Fqn#ROOT} - has a singleparent) and data contained within the node (as key/value pairs). The data access methods are similar to the collections {@link Map} interface, but some are read-only or return copies of the underlying the data.
@author Manik Surtani (manik AT jboss DOT org) @see org.infinispan.tree.TreeCache @since 4.0

      assertTrue(cache.getRoot().hasChild(fqn));


      assertEquals(true, cache.removeNode(fqn));
      assertFalse(cache.getRoot().hasChild(fqn));
      // remove should REALLY remove though and not just mark as deleted/invalid.
      Node n = cache.getNode(fqn);
      assert n == null;


      assertEquals(false, cache.removeNode(fqn));


      // remove should REALLY remove though and not just mark as deleted/invalid.

View Full Code Here

   public void testGetChildAPI() {


      Node<Object, Object> rootNode = cache.getRoot();


      // creates a Node<Object, Object> with fqn /a/b/c
      Node childA = rootNode.addChild(A);
      childA.addChild(B).addChild(C);


      rootNode.getChild(A).put("key", "value");
      rootNode.getChild(A).getChild(B).put("key", "value");
      rootNode.getChild(A).getChild(B).getChild(C).put("key", "value");

View Full Code Here

      // re-fetch nodeC
      nodeC = treeCache.getNode(Fqn.fromRelativeFqn(nodeB.getFqn(), C));


      log.info("POST MOVE " + treeCache);
      log.info("HC " + nodeC + " " + System.identityHashCode(nodeC));
      Node x = treeCache.getRoot().getChild(Fqn.fromString("b/c"));
      log.info("HC " + x + " " + System.identityHashCode(x));
      /*
         /a
         /b/c
      */

View Full Code Here


   public void testMoveInSamePlace() {
      Node<Object, Object> rootNode = treeCache.getRoot();
      final Fqn FQN_X = Fqn.fromString("/x");
      // set up the initial structure.
      Node aNode = rootNode.addChild(A);
      Node xNode = aNode.addChild(FQN_X);
      assertEquals(aNode.getChildren().size(), 1);


      System.out.println("Before: " + TreeStructureSupport.printTree(treeCache, true));


      treeCache.move(xNode.getFqn(), aNode.getFqn());


      System.out.println("After: " + TreeStructureSupport.printTree(treeCache, true));


      assertEquals(aNode.getChildren().size(), 1);

View Full Code Here

0 1

TOP

Related Classes of org.infinispan.tree.Node

org.infinispan.api.tree.BaseNodeMoveAPITest

org.infinispan.api.tree.NodeAPITest

org.infinispan.api.tree.NodeMoveAPITest

org.infinispan.api.tree.TreeCacheAPITest

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.