private Path GetFirstPath(Traverser traverse) { using (ResourceIterator <Path> iterator = traverse.GetEnumerator()) { return(Iterators.first(iterator)); } }
private void Execute(TraversalDescription traversal, Uniqueness uniqueness) { using (Transaction transaction = BeginTx()) { Traverser traverser = traversal.Uniqueness(uniqueness).traverse(Node("1")); assertNotEquals("empty traversal", 0, Iterables.count(traverser)); } }
//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes: //ORIGINAL LINE: @Test public void testPathIterator() public virtual void TestPathIterator() { Traverser traverse = GraphDb.traversalDescription().evaluator(atDepth(4)).traverse(Node("A")); using (ResourceIterator <Path> resourceIterator = traverse.GetEnumerator()) { //JAVA TO C# CONVERTER TODO TASK: Java iterators are only converted within the context of 'while' and 'for' loops: Path path = resourceIterator.next(); AssertPathIsCorrect(path); } }
//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes: //ORIGINAL LINE: @Test public void reverseNodes() public virtual void ReverseNodes() { Traverser traverse = GraphDb.traversalDescription().evaluator(atDepth(0)).traverse(_a); Path path = GetFirstPath(traverse); AssertContains(path.ReverseNodes(), _a); Traverser traverse2 = GraphDb.traversalDescription().evaluator(atDepth(4)).traverse(_a); Path path2 = GetFirstPath(traverse2); AssertContainsInOrder(path2.ReverseNodes(), _e, _d, _c, _b, _a); }
//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes: //ORIGINAL LINE: @Test public void reverseRelationships() public virtual void ReverseRelationships() { Traverser traverser = GraphDb.traversalDescription().evaluator(atDepth(0)).traverse(_a); Path path = GetFirstPath(traverser); assertFalse(path.ReverseRelationships().GetEnumerator().hasNext()); Traverser traverser2 = GraphDb.traversalDescription().evaluator(atDepth(4)).traverse(_a); Path path2 = GetFirstPath(traverser2); Node[] expectedNodes = new Node[] { _e, _d, _c, _b, _a }; int index = 0; foreach (Relationship rel in path2.ReverseRelationships()) { assertEquals("For index " + index, expectedNodes[index++], rel.EndNode); } assertEquals(4, index); }