Examples of TreeRange

org.apache.cassandra.utils.MerkleTree.TreeRange
org.richfaces.model.TreeRange
{@link Range} implmentation variant for {@link AbstractTreeDataModel} @author Nick Belaevski - nbelaevski@exadel.comcreated 23.11.2006

Examples of org.apache.cassandra.utils.MerkleTree.TreeRange

        for (TreeRange range : mt.invalids())
            range.addAll(new HIterator(range.right));
        for (TreeRange range : mt2.invalids())
            range.addAll(new HIterator(range.right));


        TreeRange leftmost = null;
        TreeRange middle = null;


        mt.maxsize(maxsize + 2); // give some room for splitting


        // split the leftmost
        Iterator<TreeRange> ranges = mt.invalids();
        leftmost = ranges.next();
        mt.split(leftmost.right);


        // set the hashes for the leaf of the created split
        middle = mt.get(leftmost.right);
        middle.hash("arbitrary!".getBytes());
        mt.get(partitioner.midpoint(leftmost.left, leftmost.right)).hash("even more arbitrary!".getBytes());


        // trees should disagree for (leftmost.left, middle.right]
        List<TreeRange> diffs = MerkleTree.difference(mt, mt2);
        assertEquals(diffs + " contains wrong number of differences:", 1, diffs.size());

View Full Code Here

Examples of org.apache.cassandra.utils.MerkleTree.TreeRange

        for (TreeRange range : mt.invalids())
            range.addAll(new HIterator(range.right));
        for (TreeRange range : mt2.invalids())
            range.addAll(new HIterator(range.right));


        TreeRange leftmost = null;
        TreeRange middle = null;


        mt.maxsize(maxsize + 2); // give some room for splitting


        // split the leftmost
        Iterator<TreeRange> ranges = mt.invalids();
        leftmost = ranges.next();
        mt.split(leftmost.right);


        // set the hashes for the leaf of the created split
        middle = mt.get(leftmost.right);
        middle.hash("arbitrary!".getBytes());
        mt.get(partitioner.midpoint(leftmost.left, leftmost.right)).hash("even more arbitrary!".getBytes());


        // trees should disagree for (leftmost.left, middle.right]
        List<TreeRange> diffs = MerkleTree.difference(mt, mt2);
        assertEquals(diffs + " contains wrong number of differences:", 1, diffs.size());

View Full Code Here

Examples of org.apache.cassandra.utils.MerkleTree.TreeRange

        for (TreeRange range : mt.invalids())
            range.addAll(new HIterator(range.right));
        for (TreeRange range : mt2.invalids())
            range.addAll(new HIterator(range.right));


        TreeRange leftmost = null;
        TreeRange middle = null;


        mt.maxsize(maxsize + 2); // give some room for splitting


        // split the leftmost
        Iterator<TreeRange> ranges = mt.invalids();
        leftmost = ranges.next();
        mt.split(leftmost.right);


        // set the hashes for the leaf of the created split
        middle = mt.get(leftmost.right);
        middle.hash("arbitrary!".getBytes());
        mt.get(partitioner.midpoint(leftmost.left, leftmost.right)).hash("even more arbitrary!".getBytes());


        // trees should disagree for (leftmost.left, middle.right]
        List<TreeRange> diffs = MerkleTree.difference(mt, mt2);
        assertEquals(diffs + " contains wrong number of differences:", 1, diffs.size());

View Full Code Here

Examples of org.richfaces.model.TreeRange


  private boolean _transient;


  public Range getRange() {
    if (stopInCollapsed) {
      return new TreeRange() {


        public boolean processChildren(TreeRowKey rowKey) {
          if (rowKey == null) {
            return true;
          }

View Full Code Here

Examples of org.richfaces.model.TreeRange

      input.setRowKey(context, key);


      RendererDataModelEventNavigator levelNavigator = new RendererDataModelEventNavigator(input, rowKey, context,
          droppedDownToLevelFlag);


      final TreeRange stateRange = (TreeRange) input.getComponentState().getRange();
      TreeRange treeRange = new TreeRange() {


        public boolean processChildren(TreeRowKey rowKey) {
          return withSubnodes ? stateRange.processChildren(rowKey) : false;
        }

View Full Code Here

Examples of org.richfaces.model.TreeRange

      input.setRowKey(context, key);


      RendererDataModelEventNavigator levelNavigator = new RendererDataModelEventNavigator(input, rowKey, context,
          droppedDownToLevelFlag);


      final TreeRange stateRange = (TreeRange) input.getComponentState().getRange();
      TreeRange treeRange = new TreeRange() {


        public boolean processChildren(TreeRowKey rowKey) {
          return stateRange.processChildren(rowKey);
        }

View Full Code Here

Examples of org.richfaces.model.TreeRange

      input.setRowKey(context, key);


      RendererDataModelEventNavigator levelNavigator = new RendererDataModelEventNavigator(input, rowKey, context,
          droppedDownToLevelFlag);


      final TreeRange stateRange = (TreeRange) input.getComponentState().getRange();
      TreeRange treeRange = new TreeRange() {


        public boolean processChildren(TreeRowKey rowKey) {
          return withSubnodes ? stateRange.processChildren(rowKey) : false;
        }

View Full Code Here

Examples of org.richfaces.model.TreeRange

      }


      RendererDataModelEventNavigator levelNavigator = new RendererDataModelEventNavigator(input, rowKey, context,
          droppedDownToLevelFlag);


      final TreeRange stateRange = (TreeRange) input.getComponentState().getRange();
      TreeRange treeRange = new TreeRange() {


        public boolean processChildren(TreeRowKey rowKey) {
          return stateRange.processChildren(rowKey);
        }

View Full Code Here

Examples of org.richfaces.model.TreeRange

    if (treeRange != null) {
      return treeRange;
    }


    if (stopInCollapsed) {
      return new TreeRange() {


        public boolean processChildren(TreeRowKey rowKey) {
          if (rowKey == null) {
            return true;
          }

View Full Code Here

Examples of org.richfaces.model.TreeRange

    // infoAppender = storedPersister.getAppender(rowKey);
    // } else {
    // infoAppender = null;
    // }


    TreeRange range;
    // it's enough to traverse only subkeys of the node
    // we're opening
    range = new TreeRange() {
      public boolean processChildren(TreeRowKey nextKey) {
        return true;
      }


      public boolean processNode(TreeRowKey nextKey) {

View Full Code Here

0 1 2

TOP

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.