}); assertEquals(result.memory().getIteration(), 30); assertEquals(result.memory().asMap().size(), 0);
@Test @LoadGraphWith(MODERN) public void shouldAndOrIncrCorrectlyThroughSubStages() throws Exception { ComputerResult results = graphProvider.getGraphComputer(graph).program(new VertexProgramG()).submit().get(); assertEquals(2, results.memory().getIteration()); assertEquals(6, results.memory().asMap().size()); assertEquals(6, results.memory().keys().size()); assertTrue(results.memory().keys().contains("a")); assertTrue(results.memory().keys().contains("b")); assertTrue(results.memory().keys().contains("c")); assertTrue(results.memory().keys().contains("d")); assertTrue(results.memory().keys().contains("e")); assertTrue(results.memory().keys().contains("f")); assertEquals(Long.valueOf(18), results.memory().get("a")); assertEquals(Long.valueOf(0), results.memory().get("b")); assertFalse(results.memory().get("c")); assertTrue(results.memory().get("d")); assertTrue(results.memory().get("e")); assertEquals(3, results.memory().<Integer>get("f").intValue()); }
}); assertEquals(result.memory().getIteration(), 11); assertEquals(result.memory().asMap().size(), 0);
@Test @LoadGraphWith(MODERN) public void shouldHaveConsistentMemoryVertexPropertiesAndExceptions() throws Exception { ComputerResult results = graphProvider.getGraphComputer(graph).program(new VertexProgramF()).submit().get(); assertEquals(1, results.memory().getIteration()); assertEquals(2, results.memory().asMap().size()); assertEquals(2, results.memory().keys().size()); assertTrue(results.memory().keys().contains("a")); assertTrue(results.memory().keys().contains("b")); assertTrue(results.memory().getRuntime() >= 0); assertEquals(12, results.memory().<Integer>get("a").intValue()); // 2 iterations assertEquals(28, results.memory().<Integer>get("b").intValue()); try { results.memory().get("BAD"); fail("Should throw an IllegalArgumentException"); } catch (IllegalArgumentException e) { assertEquals(Memory.Exceptions.memoryDoesNotExist("BAD").getMessage(), e.getMessage()); } assertEquals(Long.valueOf(0), results.graph().traversal().V().count().next()); // persist new/nothing. results.graph().traversal().V().forEachRemaining(v -> { assertTrue(v.property("nameLengthCounter").isPresent()); assertEquals(Integer.valueOf(v.<String>value("name").length() * 2), Integer.valueOf(v.<Integer>value("nameLengthCounter"))); }); }
assertEquals(2.0, (Double) result.graph().traversal().E().hasLabel("created").values("weight").sum().next(), 0.01); assertEquals(result.memory().getIteration(), 0); assertEquals(result.memory().asMap().size(), 0);
assertEquals(2.0, (Double) result.graph().traversal().E().hasLabel("created").values("weight").sum().next(), 0.01); assertEquals(result.memory().getIteration(), 0); assertEquals(result.memory().asMap().size(), 0);
@Test @LoadGraphWith(MODERN) public void shouldHaveConsistentMemoryVertexPropertiesAndExceptions() throws Exception { ComputerResult results = graphProvider.getGraphComputer(graph).program(new VertexProgramF()).submit().get(); assertEquals(1, results.memory().getIteration()); assertEquals(2, results.memory().asMap().size()); assertEquals(2, results.memory().keys().size()); assertTrue(results.memory().keys().contains("a")); assertTrue(results.memory().keys().contains("b")); assertTrue(results.memory().getRuntime() >= 0); assertEquals(12, results.memory().<Integer>get("a").intValue()); // 2 iterations assertEquals(28, results.memory().<Integer>get("b").intValue()); try { results.memory().get("BAD"); fail("Should throw an IllegalArgumentException"); } catch (IllegalArgumentException e) { assertEquals(Memory.Exceptions.memoryDoesNotExist("BAD").getMessage(), e.getMessage()); } assertEquals(Long.valueOf(0), results.graph().traversal().V().count().next()); // persist new/nothing. results.graph().traversal().V().forEachRemaining(v -> { assertTrue(v.property("nameLengthCounter").isPresent()); assertEquals(Integer.valueOf(v.<String>value("name").length() * 2), Integer.valueOf(v.<Integer>value("nameLengthCounter"))); }); }
}); assertEquals(result.memory().getIteration(), 11); assertEquals(result.memory().asMap().size(), 0);
}); assertEquals(result.memory().getIteration(), 30); assertEquals(result.memory().asMap().size(), 0);
@Test @LoadGraphWith(MODERN) public void shouldAndOrIncrCorrectlyThroughSubStages() throws Exception { ComputerResult results = graphProvider.getGraphComputer(graph).program(new VertexProgramG()).submit().get(); assertEquals(2, results.memory().getIteration()); assertEquals(6, results.memory().asMap().size()); assertEquals(6, results.memory().keys().size()); assertTrue(results.memory().keys().contains("a")); assertTrue(results.memory().keys().contains("b")); assertTrue(results.memory().keys().contains("c")); assertTrue(results.memory().keys().contains("d")); assertTrue(results.memory().keys().contains("e")); assertTrue(results.memory().keys().contains("f")); assertEquals(Long.valueOf(18), results.memory().get("a")); assertEquals(Long.valueOf(0), results.memory().get("b")); assertFalse(results.memory().get("c")); assertTrue(results.memory().get("d")); assertTrue(results.memory().get("e")); assertEquals(3, results.memory().<Integer>get("f").intValue()); }
assertEquals(2.0, (Double) result.graph().traversal().E().hasLabel("created").values("weight").sum().next(), 0.01); assertEquals(result.memory().getIteration(), 0); assertEquals(result.memory().asMap().size(), 0);
assertEquals(2.0, (Double) result.graph().traversal().E().hasLabel("created").values("weight").sum().next(), 0.01); assertEquals(result.memory().getIteration(), 0); assertEquals(result.memory().asMap().size(), 0);