mirror of https://gitee.com/bigwinds/arangodb
Merge branch 'devel' of https://github.com/triAGENS/ArangoDB into devel
This commit is contained in:
commit
a289c9aa78
|
@ -659,7 +659,7 @@ TRI_associative_pointer_t* TRI_CreateFunctionsAql (void) {
|
|||
|
||||
// graph functions
|
||||
REGISTER_FUNCTION("PATHS", "GRAPH_PATHS", false, false, "c,h|s,b", &OptimisePaths);
|
||||
REGISTER_FUNCTION("GRAPH_PATHS", "GENERAL_GRAPH_PATHS", false, false, "s|a", &OptimisePaths);
|
||||
REGISTER_FUNCTION("GRAPH_PATHS", "GENERAL_GRAPH_PATHS", false, false, "s|a", NULL);
|
||||
REGISTER_FUNCTION("SHORTEST_PATH", "GRAPH_SHORTEST_PATH", false, false, "h,h,s,s,s|a", NULL);
|
||||
REGISTER_FUNCTION("GRAPH_SHORTEST_PATH", "GENERAL_GRAPH_SHORTEST_PATH", false, false, "s,als,als|a", NULL);
|
||||
REGISTER_FUNCTION("GRAPH_DISTANCE_TO", "GENERAL_GRAPH_DISTANCE_TO", false, false, "s,als,als|a", NULL);
|
||||
|
|
|
@ -2755,12 +2755,12 @@ function MeasurementsSuite() {
|
|||
/// @brief executes the test suites
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
|
||||
//jsunity.run(GeneralGraphCommonNeighborsSuite);
|
||||
//jsunity.run(GeneralGraphAQLQueriesSuite);
|
||||
//jsunity.run(EdgesAndVerticesSuite);
|
||||
//jsunity.run(GeneralGraphCreationSuite);
|
||||
//jsunity.run(ChainedFluentAQLResultsSuite);
|
||||
//jsunity.run(OrphanCollectionSuite);
|
||||
jsunity.run(GeneralGraphCommonNeighborsSuite);
|
||||
jsunity.run(GeneralGraphAQLQueriesSuite);
|
||||
jsunity.run(EdgesAndVerticesSuite);
|
||||
jsunity.run(GeneralGraphCreationSuite);
|
||||
jsunity.run(ChainedFluentAQLResultsSuite);
|
||||
jsunity.run(OrphanCollectionSuite);
|
||||
jsunity.run(MeasurementsSuite);
|
||||
|
||||
return jsunity.done();
|
||||
|
|
|
@ -560,7 +560,7 @@ function ahuacatlQueryGeneralPathsTestSuite() {
|
|||
testPathsWithDirectionAnyAndMaxLength1: function () {
|
||||
var actual, result = {}, i = 0, ed;
|
||||
|
||||
actual = getQueryResults("FOR e IN GRAPH_PATHS('bla3', 'any', false , 1 , 1) SORT e.source._key,e.destination._key RETURN [e.source._key,e.destination._key,e.edges]");
|
||||
actual = getQueryResults("FOR e IN GRAPH_PATHS('bla3', {direction :'any', minLength : 1 , maxLength: 1}) SORT e.source._key,e.destination._key RETURN [e.source._key,e.destination._key,e.edges]");
|
||||
actual.forEach(function (p) {
|
||||
i++;
|
||||
ed = "";
|
||||
|
@ -589,7 +589,7 @@ function ahuacatlQueryGeneralPathsTestSuite() {
|
|||
testInBoundPaths: function () {
|
||||
var actual, result = {}, i = 0, ed;
|
||||
|
||||
actual = getQueryResults("FOR e IN GRAPH_PATHS('bla3', 'inbound', false, 1) SORT e.source._key,e.destination._key RETURN [e.source._key,e.destination._key,e.edges]");
|
||||
actual = getQueryResults("FOR e IN GRAPH_PATHS('bla3', {direction : 'inbound', minLength : 1}) SORT e.source._key,e.destination._key RETURN [e.source._key,e.destination._key,e.edges]");
|
||||
|
||||
actual.forEach(function (p) {
|
||||
i++;
|
||||
|
|
Loading…
Reference in New Issue