CountTest.Traversals
config, g, graph, graphProvider, name, shouldTestIteratorLeak
Constructor and Description |
---|
Traversals() |
g_V_both_both_count, g_V_count, g_V_fold_countXlocalX, g_V_hasXnoX_count, g_V_out_count, g_V_repeatXoutX_timesX3X_count, g_V_repeatXoutX_timesX5X_asXaX_outXwrittenByX_asXbX_selectXa_bX_count, g_V_repeatXoutX_timesX8X_count, g_V_whereXinXkknowsX_outXcreatedX_count_is_0XX_name
checkMap, checkOrderedResults, checkResults, checkResults, checkSideEffects, graphMeetsTestRequirements, hasGraphComputerRequirement, makeMapList, setupTest
afterLoadGraphWith, assertVertexEdgeCounts, beforeLoadGraphWith, convertToEdge, convertToEdgeId, convertToEdgeId, convertToVertex, convertToVertexId, convertToVertexId, convertToVertexProperty, convertToVertexPropertyId, convertToVertexPropertyId, getAssertVertexEdgeCounts, printTraversalForm, setup, tearDown, tryCommit, tryCommit, tryRollback, validateException
public Traversal<Vertex,Long> get_g_V_count()
get_g_V_count
in class CountTest
public Traversal<Vertex,Long> get_g_V_out_count()
get_g_V_out_count
in class CountTest
public Traversal<Vertex,Long> get_g_V_both_both_count()
get_g_V_both_both_count
in class CountTest
public Traversal<Vertex,Long> get_g_V_repeatXoutX_timesX3X_count()
get_g_V_repeatXoutX_timesX3X_count
in class CountTest
public Traversal<Vertex,Long> get_g_V_repeatXoutX_timesX8X_count()
get_g_V_repeatXoutX_timesX8X_count
in class CountTest
public Traversal<Vertex,Long> get_g_V_repeatXoutX_timesX5X_asXaX_outXwrittenByX_asXbX_selectXa_bX_count()
get_g_V_repeatXoutX_timesX5X_asXaX_outXwrittenByX_asXbX_selectXa_bX_count
in class CountTest
public Traversal<Vertex,Long> get_g_V_hasXnoX_count()
get_g_V_hasXnoX_count
in class CountTest
public Traversal<Vertex,Long> get_g_V_fold_countXlocalX()
get_g_V_fold_countXlocalX
in class CountTest
public Traversal<Vertex,String> get_g_V_whereXinXknowsX_outXcreatedX_count_is_0XX_name()
get_g_V_whereXinXknowsX_outXcreatedX_count_is_0XX_name
in class CountTest
Copyright © 2013–2019 Apache Software Foundation. All rights reserved.