Package javax.jcr

Examples of javax.jcr.NodeIterator.skip()


            }

            // re-aquire iterator
            it = rs.getNodes();
            try {
                it.skip(count + 1);
                fail("skip() must throw a NoSuchElementException if one tries to skip past the end of the iterator");
            } catch (NoSuchElementException e) {
                // success
            }
        }
View Full Code Here


            count++;
        }
        if (count > 0) {
            // re-aquire iterator
            iter = testRootNode.getNodes();
            iter.skip(count);
            try {
                iter.nextNode();
                fail("nextNode() must throw a NoSuchElementException when no nodes are available");
            } catch (NoSuchElementException e) {
                // success
View Full Code Here

            }

            // re-aquire iterator
            iter = testRootNode.getNodes();
            try {
                iter.skip(count + 1);
                fail("skip() must throw a NoSuchElementException if one tries to skip past the end of the iterator");
            } catch (NoSuchElementException e) {
                // success
            }
        }
View Full Code Here

         if (iterator.getSize() < 1)
         {
            return null;
         }
         int i = random.nextInt((int)iterator.getSize());
         iterator.skip(i);
         return iterator.nextNode();
      }
   }
}
View Full Code Here

         if (iterator.getSize() < 1)
         {
            return null;
         }
         int i = random.nextInt((int)iterator.getSize());
         iterator.skip(i);
         return iterator.nextNode();
      }
   }

   private class WriterTask implements Runnable
View Full Code Here

      Node testRoot = root.getNode(testRootName);
      long time = System.currentTimeMillis();
      NodeIterator nodeIterartor = testRoot.getNodes();
      long size = nodeIterartor.getSize();
      assertEquals(NODES_COUNT, size);
      nodeIterartor.skip(NEED_NODES);
      for (int i = 0; i < NEED_NODES; i++)
      {
         Node node = nodeIterartor.nextNode();
         assertEquals(i + NEED_NODES, node.getProperty("val").getLong());
      }
View Full Code Here

      long time = System.currentTimeMillis();
      NodeIterator nodeIterartor = result.getNodes();
      long size = nodeIterartor.getSize();
      assertEquals(NODES_COUNT, size);
      nodeIterartor.skip(NEED_NODES);
      for (int i = 0; i < NEED_NODES; i++)
      {
         Node node = nodeIterartor.nextNode();
         assertEquals(i + NEED_NODES, node.getProperty("val").getLong());
      }
View Full Code Here

         if (iterator.getSize() < 1)
         {
            return null;
         }
         int i = random.nextInt((int)iterator.getSize());
         iterator.skip(i);
         return iterator.nextNode();
      }
   }
}
View Full Code Here

         if (iterator.getSize() < 1)
         {
            return null;
         }
         int i = random.nextInt((int)iterator.getSize());
         iterator.skip(i);
         return iterator.nextNode();
      }
   }
}
View Full Code Here

    public void testOffsetAndSkip() throws Exception {
        query.setOffset(1);
        QueryResult result = query.execute();
        NodeIterator nodes = result.getNodes();
        nodes.skip(1);
        assertTrue(nodes.nextNode() == node3);
    }

    public void testOffsetAndLimitWithGetSize() throws Exception {
        query.setOffset(1);
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.