mirror of https://gitee.com/bigwinds/arangodb
1063 lines
34 KiB
JavaScript
1063 lines
34 KiB
JavaScript
/*jshint esnext: true */
|
|
/*global assertEqual, fail*/
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Spec for the AQL FOR x IN GRAPH name statement
|
|
///
|
|
/// @file
|
|
///
|
|
/// DISCLAIMER
|
|
///
|
|
/// Copyright 2014 ArangoDB GmbH, Cologne, Germany
|
|
///
|
|
/// Licensed under the Apache License, Version 2.0 (the "License");
|
|
/// you may not use this file except in compliance with the License.
|
|
/// You may obtain a copy of the License at
|
|
///
|
|
/// http://www.apache.org/licenses/LICENSE-2.0
|
|
///
|
|
/// Unless required by applicable law or agreed to in writing, software
|
|
/// distributed under the License is distributed on an "AS IS" BASIS,
|
|
/// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
/// See the License for the specific language governing permissions and
|
|
/// limitations under the License.
|
|
///
|
|
/// Copyright holder is ArangoDB GmbH, Cologne, Germany
|
|
///
|
|
/// @author Michael Hackstein
|
|
/// @author Copyright 2015, ArangoDB GmbH, Cologne, Germany
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
(function() {
|
|
"use strict";
|
|
|
|
const jsunity = require("jsunity");
|
|
|
|
const internal = require("internal");
|
|
const db = internal.db;
|
|
const errors = require("org/arangodb").errors;
|
|
const gm = require("org/arangodb/general-graph");
|
|
const vn = "UnitTestVertexCollection";
|
|
const en = "UnitTestEdgeCollection";
|
|
var vertex = {};
|
|
var edge = {};
|
|
var vc;
|
|
var ec;
|
|
|
|
var cleanup = function () {
|
|
db._drop(vn);
|
|
db._drop(en);
|
|
vertex = {};
|
|
edge = {};
|
|
};
|
|
|
|
var createBaseGraph = function () {
|
|
vc = db._create(vn, {numberOfShards: 4});
|
|
ec = db._createEdgeCollection(en, {numberOfShards: 4});
|
|
vertex.A = vc.save({_key: "A"})._id;
|
|
vertex.B = vc.save({_key: "B"})._id;
|
|
vertex.C = vc.save({_key: "C"})._id;
|
|
vertex.D = vc.save({_key: "D"})._id;
|
|
vertex.E = vc.save({_key: "E"})._id;
|
|
vertex.F = vc.save({_key: "F"})._id;
|
|
|
|
edge.AB = ec.save(vertex.A, vertex.B, {})._id;
|
|
edge.BC = ec.save(vertex.B, vertex.C, {})._id;
|
|
edge.CD = ec.save(vertex.C, vertex.D, {})._id;
|
|
edge.CF = ec.save(vertex.C, vertex.F, {})._id;
|
|
edge.EB = ec.save(vertex.E, vertex.B, {})._id;
|
|
edge.FE = ec.save(vertex.F, vertex.E, {})._id;
|
|
};
|
|
|
|
function namedGraphSuite () {
|
|
|
|
/***********************************************************************
|
|
* Graph under test:
|
|
*
|
|
* A -> B -> C -> D
|
|
* /|\ \|/
|
|
* E <- F
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
***********************************************************************/
|
|
|
|
var g;
|
|
const gn = "UnitTestGraph";
|
|
|
|
return {
|
|
|
|
setUp: function() {
|
|
cleanup();
|
|
createBaseGraph();
|
|
try {
|
|
gm._drop(gn);
|
|
} catch (e) {
|
|
// It is expected that this graph does not exist.
|
|
}
|
|
g = gm._create(gn, [gm._relation(en, vn, vn)]);
|
|
},
|
|
|
|
tearDown: function () {
|
|
gm._drop(gn);
|
|
cleanup();
|
|
},
|
|
|
|
testFirstEntryIsVertex: function () {
|
|
var query = "FOR x IN OUTBOUND @startId GRAPH @graph RETURN x";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
assertEqual(result[0]._id, vertex.C);
|
|
},
|
|
|
|
testSecondEntryIsEdge: function () {
|
|
var query = "FOR x, e IN OUTBOUND @startId GRAPH @graph RETURN e";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
assertEqual(result[0]._id, edge.BC);
|
|
},
|
|
|
|
testThirdEntryIsPath: function () {
|
|
var query = "FOR x, e, p IN OUTBOUND @startId GRAPH @graph RETURN p";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
var entry = result[0];
|
|
assertEqual(entry.vertices.length, 2);
|
|
assertEqual(entry.vertices[0]._id, vertex.B);
|
|
assertEqual(entry.vertices[1]._id, vertex.C);
|
|
assertEqual(entry.edges.length, 1);
|
|
assertEqual(entry.edges[0]._id, edge.BC);
|
|
},
|
|
|
|
testOutboundDirection: function () {
|
|
var query = "FOR x IN OUTBOUND @startId GRAPH @graph RETURN x._id";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
var entry = result[0];
|
|
assertEqual(entry, vertex.C);
|
|
},
|
|
|
|
testInboundDirection: function () {
|
|
var query = "FOR x IN INBOUND @startId GRAPH @graph RETURN x._id";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.C
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
var entry = result[0];
|
|
assertEqual(entry, vertex.B);
|
|
},
|
|
|
|
testAnyDirection: function () {
|
|
var query = "FOR x IN ANY @startId GRAPH @graph SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 3);
|
|
var entry = result[0];
|
|
assertEqual(entry, vertex.A);
|
|
entry = result[1];
|
|
assertEqual(entry, vertex.C);
|
|
entry = result[2];
|
|
assertEqual(entry, vertex.E);
|
|
},
|
|
|
|
testExactNumberSteps: function () {
|
|
var query = "FOR x IN 2 OUTBOUND @startId GRAPH @graph SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 2);
|
|
|
|
assertEqual(result[0], vertex.D);
|
|
assertEqual(result[1], vertex.F);
|
|
},
|
|
|
|
testRangeNumberSteps: function () {
|
|
var query = "FOR x IN 2..3 OUTBOUND @startId GRAPH @graph SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 3);
|
|
|
|
assertEqual(result[0], vertex.D);
|
|
assertEqual(result[1], vertex.E);
|
|
assertEqual(result[2], vertex.F);
|
|
},
|
|
|
|
testComputedNumberSteps: function () {
|
|
var query = "FOR x IN LENGTH([1,2]) OUTBOUND @startId GRAPH @graph SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 2);
|
|
|
|
assertEqual(result[0], vertex.D);
|
|
},
|
|
|
|
testSort: function () {
|
|
var query = "FOR x IN OUTBOUND @startId GRAPH @graph SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
graph: gn,
|
|
startId: vertex.C
|
|
};
|
|
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 2);
|
|
assertEqual(result[0], vertex.D);
|
|
assertEqual(result[1], vertex.F);
|
|
|
|
// Reverse ordering
|
|
query = "FOR x IN OUTBOUND @startId GRAPH @graph SORT x._id DESC RETURN x._id";
|
|
|
|
result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 2);
|
|
assertEqual(result[0], vertex.F);
|
|
assertEqual(result[1], vertex.D);
|
|
}
|
|
|
|
};
|
|
};
|
|
|
|
function multiCollectionGraphSuite () {
|
|
|
|
/***********************************************************************
|
|
* Graph under test:
|
|
*
|
|
* A -> B -> C -> D <-E2- V2:G
|
|
* /|\ \|/
|
|
* E <- F
|
|
*
|
|
*
|
|
*
|
|
***********************************************************************/
|
|
|
|
var g;
|
|
const gn = "UnitTestGraph";
|
|
const vn2 = "UnitTestVertexCollection2";
|
|
const en2 = "UnitTestEdgeCollection2";
|
|
|
|
// We always use the same query, the result should be identical.
|
|
var validateResult = function (result) {
|
|
assertEqual(result.length, 1);
|
|
var entry = result[0];
|
|
assertEqual(entry.vertex._id, vertex.C);
|
|
assertEqual(entry.path.vertices.length, 2);
|
|
assertEqual(entry.path.vertices[0]._id, vertex.B);
|
|
assertEqual(entry.path.vertices[1]._id, vertex.C);
|
|
assertEqual(entry.path.edges.length, 1);
|
|
assertEqual(entry.path.edges[0]._id, edge.BC);
|
|
};
|
|
|
|
return {
|
|
|
|
setUp: function() {
|
|
cleanup();
|
|
try {
|
|
gm._drop(gn);
|
|
} catch (e) {
|
|
// It is expected that this graph does not exist.
|
|
}
|
|
db._drop(vn2);
|
|
db._drop(en2);
|
|
createBaseGraph();
|
|
g = gm._create(gn, [gm._relation(en, vn, vn), gm._relation(en2, vn2, vn)]);
|
|
db[vn2].save({_key: "G"});
|
|
db[en2].save(vn2 + "/G", vn + "/D", {});
|
|
},
|
|
|
|
tearDown: function() {
|
|
gm._drop(gn);
|
|
db._drop(vn2);
|
|
db._drop(en2);
|
|
cleanup();
|
|
},
|
|
|
|
testNoBindParameter: function () {
|
|
var query = "FOR x, e, p IN OUTBOUND '" + vertex.B + "' " + en + " RETURN {vertex: x, path: p}";
|
|
validateResult(db._query(query).toArray());
|
|
},
|
|
|
|
testStartBindParameter: function () {
|
|
var query = "FOR x, e, p IN OUTBOUND @startId " + en + " RETURN {vertex: x, path: p}";
|
|
var bindVars = {
|
|
startId: vertex.B
|
|
};
|
|
validateResult(db._query(query, bindVars).toArray());
|
|
},
|
|
|
|
testEdgeCollectionBindParameter: function () {
|
|
var query = "FOR x, e, p IN OUTBOUND '" + vertex.B + "' @@eCol RETURN {vertex: x, path: p}";
|
|
var bindVars = {
|
|
"@eCol": en
|
|
};
|
|
validateResult(db._query(query, bindVars).toArray());
|
|
},
|
|
|
|
testStepsBindParameter: function () {
|
|
var query = "FOR x, e, p IN @steps OUTBOUND '" + vertex.B + "' " + en + " RETURN {vertex: x, path: p}";
|
|
var bindVars = {
|
|
steps: 1
|
|
};
|
|
validateResult(db._query(query, bindVars).toArray());
|
|
},
|
|
|
|
testStepsRangeBindParameter: function () {
|
|
var query = "FOR x, e, p IN @lsteps..@rsteps OUTBOUND '" + vertex.B
|
|
+ "' " + en + " RETURN {vertex: x, path: p}";
|
|
var bindVars = {
|
|
lsteps: 1,
|
|
rsteps: 1
|
|
};
|
|
validateResult(db._query(query, bindVars).toArray());
|
|
},
|
|
|
|
testFirstEntryIsVertex: function () {
|
|
var query = "FOR x IN OUTBOUND @startId @@eCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
assertEqual(result[0]._id, vertex.C);
|
|
},
|
|
|
|
testSecondEntryIsEdge: function () {
|
|
var query = "FOR x, e IN OUTBOUND @startId @@eCol RETURN e";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
assertEqual(result[0]._id, edge.BC);
|
|
},
|
|
|
|
testThirdEntryIsPath: function () {
|
|
var query = "FOR x, e, p IN OUTBOUND @startId @@eCol RETURN p";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
var entry = result[0];
|
|
assertEqual(entry.vertices.length, 2);
|
|
assertEqual(entry.vertices[0]._id, vertex.B);
|
|
assertEqual(entry.vertices[1]._id, vertex.C);
|
|
assertEqual(entry.edges.length, 1);
|
|
assertEqual(entry.edges[0]._id, edge.BC);
|
|
},
|
|
|
|
testOutboundDirection: function () {
|
|
var query = "FOR x IN OUTBOUND @startId @@eCol RETURN x._id";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
var entry = result[0];
|
|
assertEqual(entry, vertex.C);
|
|
},
|
|
|
|
testInboundDirection: function () {
|
|
var query = "FOR x IN INBOUND @startId @@eCol RETURN x._id";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.C
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
var entry = result[0];
|
|
assertEqual(entry, vertex.B);
|
|
},
|
|
|
|
testAnyDirection: function () {
|
|
var query = "FOR x IN ANY @startId @@eCol SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 3);
|
|
var entry = result[0];
|
|
assertEqual(entry, vertex.A);
|
|
entry = result[1];
|
|
assertEqual(entry, vertex.C);
|
|
entry = result[2];
|
|
assertEqual(entry, vertex.E);
|
|
},
|
|
|
|
testExactNumberSteps: function () {
|
|
var query = "FOR x IN 2 OUTBOUND @startId @@eCol SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 2);
|
|
|
|
assertEqual(result[0], vertex.D);
|
|
assertEqual(result[1], vertex.F);
|
|
},
|
|
|
|
testRangeNumberSteps: function () {
|
|
var query = "FOR x IN 2..3 OUTBOUND @startId @@eCol SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 3);
|
|
|
|
assertEqual(result[0], vertex.D);
|
|
assertEqual(result[1], vertex.E);
|
|
assertEqual(result[2], vertex.F);
|
|
},
|
|
|
|
testComputedNumberSteps: function () {
|
|
var query = "FOR x IN LENGTH([1,2]) OUTBOUND @startId @@eCol SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.B
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 2);
|
|
|
|
assertEqual(result[0], vertex.D);
|
|
},
|
|
|
|
testSort: function () {
|
|
var query = "FOR x IN OUTBOUND @startId @@eCol SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
startId: vertex.C
|
|
};
|
|
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 2);
|
|
assertEqual(result[0], vertex.D);
|
|
assertEqual(result[1], vertex.F);
|
|
|
|
// Reverse ordering
|
|
query = "FOR x IN OUTBOUND @startId @@eCol SORT x._id DESC RETURN x._id";
|
|
|
|
result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 2);
|
|
assertEqual(result[0], vertex.F);
|
|
assertEqual(result[1], vertex.D);
|
|
},
|
|
|
|
testSingleDocumentInput: function () {
|
|
var query = "FOR y IN @@vCol FILTER y._id == @startId "
|
|
+ "FOR x IN OUTBOUND y @@eCol RETURN x";
|
|
var bindVars = {
|
|
startId: vertex.B,
|
|
"@eCol": en,
|
|
"@vCol": vn
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
assertEqual(result[0]._id, vertex.C);
|
|
},
|
|
|
|
testListDocumentInput: function () {
|
|
var query = "FOR y IN @@vCol "
|
|
+ "FOR x IN OUTBOUND y @@eCol SORT x._id ASC RETURN x._id";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"@vCol": vn
|
|
};
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 6);
|
|
assertEqual(result[0], vertex.B);
|
|
assertEqual(result[1], vertex.B);
|
|
assertEqual(result[2], vertex.C);
|
|
assertEqual(result[3], vertex.D);
|
|
assertEqual(result[4], vertex.E);
|
|
assertEqual(result[5], vertex.F);
|
|
},
|
|
|
|
};
|
|
};
|
|
|
|
function potentialErrorsSuite () {
|
|
var vc, ec;
|
|
|
|
return {
|
|
|
|
setUp: function () {
|
|
cleanup();
|
|
vc = db._create(vn);
|
|
ec = db._createEdgeCollection(en);
|
|
vertex.A = vn + "/unknown";
|
|
},
|
|
|
|
tearDown: cleanup,
|
|
|
|
testNonIntegerSteps: function () {
|
|
var query = "FOR x IN 2.5 OUTBOUND @startId @@eCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": vertex.A
|
|
};
|
|
try {
|
|
db._query(query, bindVars).toArray();
|
|
fail();
|
|
} catch (e) {
|
|
assertEqual(e.errorNum, errors.ERROR_QUERY_PARSE.code);
|
|
}
|
|
},
|
|
|
|
testNonNumberSteps: function () {
|
|
var query = "FOR x IN 'invalid' OUTBOUND @startId @@eCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": vertex.A
|
|
};
|
|
try {
|
|
db._query(query, bindVars).toArray();
|
|
fail();
|
|
} catch (e) {
|
|
assertEqual(e.errorNum, errors.ERROR_QUERY_PARSE.code);
|
|
}
|
|
},
|
|
|
|
testMultiDirections: function () {
|
|
var query = "FOR x IN OUTBOUND ANY @startId @@eCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": vertex.A
|
|
};
|
|
try {
|
|
db._query(query, bindVars).toArray();
|
|
fail();
|
|
} catch (e) {
|
|
assertEqual(e.errorNum, errors.ERROR_QUERY_PARSE.code);
|
|
}
|
|
},
|
|
|
|
testNoCollections: function () {
|
|
var query = "FOR x IN OUTBOUND @startId RETURN x";
|
|
var bindVars = {
|
|
"startId": vertex.A
|
|
};
|
|
try {
|
|
db._query(query, bindVars).toArray();
|
|
fail();
|
|
} catch (e) {
|
|
assertEqual(e.errorNum, errors.ERROR_QUERY_PARSE.code);
|
|
}
|
|
},
|
|
|
|
testNoStartVertex: function () {
|
|
var query = "FOR x IN OUTBOUND @@eCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en
|
|
};
|
|
try {
|
|
db._query(query, bindVars).toArray();
|
|
fail();
|
|
} catch (e) {
|
|
assertEqual(e.errorNum, errors.ERROR_QUERY_PARSE.code);
|
|
}
|
|
},
|
|
|
|
testTooManyOutputParameters: function () {
|
|
var query = "FOR x, y, z, f IN OUTBOUND @startId @@eCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": vertex.A
|
|
};
|
|
try {
|
|
db._query(query, bindVars).toArray();
|
|
fail();
|
|
} catch (e) {
|
|
assertEqual(e.errorNum, errors.ERROR_QUERY_PARSE.code);
|
|
}
|
|
},
|
|
|
|
testTraverseVertexCollection: function () {
|
|
var query = "FOR x IN OUTBOUND @startId @@eCol, @@vCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"@vCol": vn,
|
|
"startId": vertex.A
|
|
};
|
|
try {
|
|
db._query(query, bindVars).toArray();
|
|
fail(query + " should not be allowed");
|
|
} catch (e) {
|
|
assertEqual(e.errorNum, errors.ERROR_ARANGO_COLLECTION_TYPE_INVALID.code);
|
|
}
|
|
},
|
|
|
|
testStartWithSubquery: function () {
|
|
var query = "FOR x IN OUTBOUND (FOR y IN @@vCol SORT y._id LIMIT 3 RETURN y) @@eCol SORT x._id RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"@vCol": vn
|
|
};
|
|
try {
|
|
db._query(query, bindVars).toArray();
|
|
} catch (e) {
|
|
assertEqual(e.errorNum, errors.ERROR_QUERY_PARSE.code);
|
|
}
|
|
/*
|
|
var result = db._query(query, bindVars).toArray();
|
|
expect(result.length).toEqual(4);
|
|
expect(result[0]._id).toEqual(vertex.B);
|
|
expect(result[1]._id).toEqual(vertex.C);
|
|
expect(result[2]._id).toEqual(vertex.D);
|
|
expect(result[3]._id).toEqual(vertex.F);
|
|
*/
|
|
},
|
|
|
|
testStepsSubquery: function() {
|
|
var query = "FOR x IN (FOR y IN 1..1 RETURN y) OUTBOUND @startId @@eCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": vertex.A
|
|
};
|
|
try {
|
|
db._query(query, bindVars).toArray();
|
|
} catch (e) {
|
|
assertEqual(e.errorNum, errors.ERROR_QUERY_PARSE.code);
|
|
}
|
|
/*
|
|
var result = db._query(query, bindVars).toArray();
|
|
expect(result.length).toEqual(1);
|
|
expect(result[0]._id).toEqual(vertex.B);
|
|
*/
|
|
}
|
|
|
|
};
|
|
};
|
|
|
|
function complexInternaSuite () {
|
|
|
|
return {
|
|
|
|
setUp: function () {
|
|
cleanup();
|
|
createBaseGraph();
|
|
},
|
|
|
|
tearDown: cleanup,
|
|
|
|
testUnknownVertexCollection: function () {
|
|
const vn2 = "UnitTestVertexCollectionOther";
|
|
db._drop(vn2);
|
|
const vc2 = db._create(vn2);
|
|
vc.save({_key: "1"});
|
|
vc2.save({_key: "1"});
|
|
ec.save(vn + "/1", vn2 + "/1", {});
|
|
var query = "FOR x IN OUTBOUND @startId @@eCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": vn + "/1"
|
|
};
|
|
// NOTE: vn2 is not explicitly named in AQL
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
assertEqual(result[0]._id, vn2 + "/1");
|
|
db._drop(vn2);
|
|
},
|
|
|
|
testStepsFromLet: function () {
|
|
var query = "LET s = 1 FOR x IN s OUTBOUND @startId @@eCol RETURN x";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": vertex.A
|
|
};
|
|
|
|
var result = db._query(query, bindVars).toArray();
|
|
assertEqual(result.length, 1);
|
|
assertEqual(result[0]._id, vertex.B);
|
|
},
|
|
|
|
testMultipleBlocksResult: function () {
|
|
var query = "FOR x IN OUTBOUND @startId @@eCol RETURN x";
|
|
var amount = 10000;
|
|
var startId = vn + "/test";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": startId
|
|
};
|
|
vc.save({_key: startId.split("/")[1]});
|
|
|
|
// Insert amount many edges and vertices into the collections.
|
|
for (var i = 0; i < amount; ++i) {
|
|
var tmp = vc.save({_key: "" + i})._id;
|
|
ec.save(startId, tmp, {});
|
|
}
|
|
|
|
// Check that we can get all of them out again.
|
|
var result = db._query(query, bindVars).toArray();
|
|
// Internally: The Query selects elements in chunks, check that nothing is lost.
|
|
assertEqual(result.length, amount);
|
|
},
|
|
|
|
testSkipSome: function () {
|
|
var query = "FOR x, e, p IN 1..2 OUTBOUND @startId @@eCol LIMIT 4, 100 RETURN p.vertices[1]._key";
|
|
var startId = vn + "/test";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": startId
|
|
};
|
|
vc.save({_key: startId.split("/")[1]});
|
|
|
|
// Insert amount many edges and vertices into the collections.
|
|
for (var i = 0; i < 3; ++i) {
|
|
var tmp = vc.save({_key: "" + i})._id;
|
|
ec.save(startId, tmp, {});
|
|
for (var k = 0; k < 3; ++k) {
|
|
var tmp2 = vc.save({_key: "" + i + "_" + k})._id;
|
|
ec.save(tmp, tmp2, {});
|
|
}
|
|
}
|
|
|
|
// Check that we can get all of them out again.
|
|
var result = db._query(query, bindVars).toArray();
|
|
// Internally: The Query selects elements in chunks, check that nothing is lost.
|
|
assertEqual(result.length, 8);
|
|
|
|
// Each of the 3 parts of this graph contains of 4 nodes, one connected to the start.
|
|
// And 3 connected to the first one. As we do a depth first traversal we expect to skip
|
|
// exactly one sub-tree. Therefor we expect exactly two sub-trees to be traversed.
|
|
var seen = {};
|
|
for (var r of result) {
|
|
if (!seen.hasOwnProperty(r)) {
|
|
seen[r] = true;
|
|
}
|
|
}
|
|
assertEqual(Object.keys(seen).length, 2);
|
|
},
|
|
|
|
testManyResults: function () {
|
|
var query = "FOR x IN OUTBOUND @startId @@eCol RETURN x._key";
|
|
var startId = vn + "/many";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"startId": startId
|
|
};
|
|
vc.save({_key: startId.split("/")[1]});
|
|
var amount = 10000;
|
|
for (var i = 0; i < amount; ++i) {
|
|
var _id = vc.save({});
|
|
ec.save(startId, _id, {});
|
|
}
|
|
var result = db._query(query, bindVars);
|
|
var found = 0;
|
|
// Count has to be correct
|
|
assertEqual(result.count(), amount);
|
|
while (result.hasNext()) {
|
|
result.next();
|
|
++found;
|
|
}
|
|
// All elements must be enumerated
|
|
assertEqual(found, amount);
|
|
}
|
|
|
|
};
|
|
|
|
};
|
|
|
|
function complexFilteringSuite () {
|
|
|
|
/***********************************************************************
|
|
* Graph under test:
|
|
*
|
|
* C <- B <- A -> D -> E
|
|
* F <--| |--> G
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
* Tri1 --> Tri2
|
|
* ^ |
|
|
* |--Tri3<-|
|
|
*
|
|
*
|
|
***********************************************************************/
|
|
|
|
return {
|
|
setUp: function() {
|
|
cleanup();
|
|
var vc = db._create(vn, {numberOfShards: 4});
|
|
var ec = db._createEdgeCollection(en, {numberOfShards: 4});
|
|
vertex.A = vc.save({_key: "A", left: false, right: false})._id;
|
|
vertex.B = vc.save({_key: "B", left: true, right: false})._id;
|
|
vertex.C = vc.save({_key: "C", left: true, right: false})._id;
|
|
vertex.D = vc.save({_key: "D", left: false, right: true})._id;
|
|
vertex.E = vc.save({_key: "E", left: false, right: true})._id;
|
|
vertex.F = vc.save({_key: "F", left: true, right: false})._id;
|
|
vertex.G = vc.save({_key: "G", left: false, right: true})._id;
|
|
|
|
edge.AB = ec.save(vertex.A, vertex.B, {left: true, right: false})._id;
|
|
edge.BC = ec.save(vertex.B, vertex.C, {left: true, right: false})._id;
|
|
edge.AD = ec.save(vertex.A, vertex.D, {left: false, right: true})._id;
|
|
edge.DE = ec.save(vertex.D, vertex.E, {left: false, right: true})._id;
|
|
edge.BF = ec.save(vertex.B, vertex.F, {left: true, right: false})._id;
|
|
edge.DG = ec.save(vertex.D, vertex.G, {left: false, right: true})._id;
|
|
|
|
vertex.Tri1 = vc.save({_key: "Tri1", isLoop: true})._id;
|
|
vertex.Tri2 = vc.save({_key: "Tri2", isLoop: true})._id;
|
|
vertex.Tri3 = vc.save({_key: "Tri3", isLoop: true})._id;
|
|
|
|
edge.Tri12 = ec.save(vertex.Tri1, vertex.Tri2, {isLoop: true})._id;
|
|
edge.Tri23 = ec.save(vertex.Tri2, vertex.Tri3, {isLoop: true})._id;
|
|
edge.Tri31 = ec.save(vertex.Tri3, vertex.Tri1, {isLoop: true, lateLoop: true})._id;
|
|
},
|
|
|
|
tearDown: cleanup,
|
|
|
|
testVertexEarlyPruneHighDepth: function () {
|
|
var query = "FOR v, e, p IN 100 OUTBOUND @start @@eCol FILTER p.vertices[1]._key == 'wrong' RETURN v";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"start": vertex.Tri1
|
|
};
|
|
var cursor = db._query(query, bindVars);
|
|
assertEqual(cursor.count(), 0);
|
|
var stats = cursor.getExtra().stats;
|
|
assertEqual(stats.scannedFull, 0);
|
|
// 1 Primary (Tri1)
|
|
// 1 Edge (Tri1->Tri2)
|
|
// 1 Primary (Tri2)
|
|
assertEqual(stats.scannedIndex, 3);
|
|
assertEqual(stats.filtered, 1);
|
|
},
|
|
|
|
testStartVertexEarlyPruneHighDepth: function () {
|
|
var query = "FOR v, e, p IN 100 OUTBOUND @start @@eCol FILTER p.vertices[0]._key == 'wrong' RETURN v";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"start": vertex.Tri1
|
|
};
|
|
var cursor = db._query(query, bindVars);
|
|
assertEqual(cursor.count(), 0);
|
|
var stats = cursor.getExtra().stats;
|
|
assertEqual(stats.scannedFull, 0);
|
|
// 1 Primary (Tri1)
|
|
assertEqual(stats.scannedIndex, 1);
|
|
assertEqual(stats.filtered, 1);
|
|
},
|
|
|
|
testEdgesEarlyPruneHighDepth: function () {
|
|
var query = "FOR v, e, p IN 100 OUTBOUND @start @@eCol FILTER p.edges[0]._key == 'wrong' RETURN v";
|
|
var bindVars = {
|
|
"@eCol": en,
|
|
"start": vertex.Tri1
|
|
};
|
|
var cursor = db._query(query, bindVars);
|
|
assertEqual(cursor.count(), 0);
|
|
var stats = cursor.getExtra().stats;
|
|
assertEqual(stats.scannedFull, 0);
|
|
// 1 Primary (Tri1)
|
|
// 1 Edge (Tri1->Tri2)
|
|
assertEqual(stats.scannedIndex, 2);
|
|
assertEqual(stats.filtered, 1);
|
|
},
|
|
|
|
testVertexLevel0: function () {
|
|
var query = `FOR v, e, p IN 1..2 OUTBOUND @start @@ecol
|
|
FILTER p.vertices[0].left == true
|
|
SORT v._key
|
|
RETURN v._key`;
|
|
var bindVars = {
|
|
"@ecol": en,
|
|
start: vertex.A
|
|
};
|
|
var cursor = db._query(query, bindVars);
|
|
assertEqual(cursor.count(), 0);
|
|
var stats = cursor.getExtra().stats;
|
|
assertEqual(stats.scannedFull, 0);
|
|
// 1 Primary (A)
|
|
// 0 Edge
|
|
assertEqual(stats.scannedIndex, 1);
|
|
// 1 Filter (A)
|
|
assertEqual(stats.filtered, 1);
|
|
},
|
|
|
|
testVertexLevel1: function () {
|
|
var query = `FOR v, e, p IN 1..2 OUTBOUND @start @@ecol
|
|
FILTER p.vertices[1].left == true
|
|
SORT v._key
|
|
RETURN v._key`;
|
|
var bindVars = {
|
|
"@ecol": en,
|
|
start: vertex.A
|
|
};
|
|
var cursor = db._query(query, bindVars);
|
|
assertEqual(cursor.count(), 3);
|
|
assertEqual(cursor.toArray(), ["B", "C", "F"]);
|
|
var stats = cursor.getExtra().stats;
|
|
assertEqual(stats.scannedFull, 0);
|
|
// 1 Primary lookup A
|
|
// 2 Edge Lookups (A)
|
|
// 2 Primary lookup B,D
|
|
// 2 Edge Lookups (2 B) (0 D)
|
|
// 2 Primary Lookups (C, F)
|
|
assertEqual(stats.scannedIndex, 9);
|
|
// 1 Filter On D
|
|
assertEqual(stats.filtered, 1);
|
|
},
|
|
|
|
testVertexLevel2: function () {
|
|
var query = `FOR v, e, p IN 1..2 OUTBOUND @start @@ecol
|
|
FILTER p.vertices[2].left == true
|
|
SORT v._key
|
|
RETURN v._key`;
|
|
var bindVars = {
|
|
"@ecol": en,
|
|
start: vertex.A
|
|
};
|
|
var cursor = db._query(query, bindVars);
|
|
// We expect to find C, F
|
|
// B and D will be post filtered
|
|
assertEqual(cursor.count(), 2);
|
|
assertEqual(cursor.toArray(), ["C", "F"]);
|
|
var stats = cursor.getExtra().stats;
|
|
assertEqual(stats.scannedFull, 0);
|
|
// 1 Primary lookup A
|
|
// 2 Edge Lookups (A)
|
|
// 2 Primary lookup B,D
|
|
// 4 Edge Lookups (2 B) (2 D)
|
|
// 4 Primary Lookups (C, F, E, G)
|
|
assertEqual(stats.scannedIndex, 13);
|
|
// 2 Filter (E, G)
|
|
// 2 Filter A->B, A->D path too short
|
|
assertEqual(stats.filtered, 4);
|
|
},
|
|
|
|
testVertexLevelsCombined: function () {
|
|
var query = `FOR v, e, p IN 1..2 OUTBOUND @start @@ecol
|
|
FILTER p.vertices[1].right == true
|
|
FILTER p.vertices[2].left == true
|
|
SORT v._key
|
|
RETURN v._key`;
|
|
var bindVars = {
|
|
"@ecol": en,
|
|
start: vertex.A
|
|
};
|
|
var cursor = db._query(query, bindVars);
|
|
// Everything should be filtered, no results
|
|
assertEqual(cursor.count(), 0);
|
|
var stats = cursor.getExtra().stats;
|
|
assertEqual(stats.scannedFull, 0);
|
|
// 1 Primary lookup A
|
|
// 2 Edge Lookups (A)
|
|
// 2 Primary lookup B,D
|
|
// 2 Edge Lookups (0 B) (2 D)
|
|
// 2 Primary Lookups (E, G)
|
|
assertEqual(stats.scannedIndex, 9);
|
|
// 1 Filter (B)
|
|
// 2 Filter (E, G)
|
|
// Filter A->D too short
|
|
assertEqual(stats.filtered, 4);
|
|
},
|
|
|
|
testEdgeLevel0: function () {
|
|
var query = `FOR v, e, p IN 1..2 OUTBOUND @start @@ecol
|
|
FILTER p.edges[0].left == true
|
|
SORT v._key
|
|
RETURN v._key`;
|
|
var bindVars = {
|
|
"@ecol": en,
|
|
start: vertex.A
|
|
};
|
|
var cursor = db._query(query, bindVars);
|
|
assertEqual(cursor.count(), 3);
|
|
assertEqual(cursor.toArray(), ["B", "C", "F"]);
|
|
var stats = cursor.getExtra().stats;
|
|
assertEqual(stats.scannedFull, 0);
|
|
// 1 Primary (A)
|
|
// 2 Edge
|
|
// 1 Primary (B)
|
|
// 2 Edge
|
|
// 2 Primary (C,F)
|
|
assertEqual(stats.scannedIndex, 8);
|
|
// 1 Filter (A->D)
|
|
assertEqual(stats.filtered, 1);
|
|
},
|
|
|
|
testEdgeLevel1: function () {
|
|
var query = `FOR v, e, p IN 1..2 OUTBOUND @start @@ecol
|
|
FILTER p.edges[1].left == true
|
|
SORT v._key
|
|
RETURN v._key`;
|
|
var bindVars = {
|
|
"@ecol": en,
|
|
start: vertex.A
|
|
};
|
|
var cursor = db._query(query, bindVars);
|
|
assertEqual(cursor.count(), 2);
|
|
assertEqual(cursor.toArray(), ["C", "F"]);
|
|
var stats = cursor.getExtra().stats;
|
|
assertEqual(stats.scannedFull, 0);
|
|
// 1 Primary lookup A
|
|
// 2 Edge Lookups (A)
|
|
// 2 Primary lookup B,D
|
|
// 4 Edge Lookups (2 B) (2 D)
|
|
// 2 Primary Lookups (C, F)
|
|
assertEqual(stats.scannedIndex, 11);
|
|
// 2 Filter On (D->E, D->G)
|
|
// Filter on A->D, A->B because path is too short is not counted. No Document!
|
|
assertEqual(stats.filtered, 4);
|
|
}
|
|
|
|
|
|
|
|
};
|
|
|
|
};
|
|
|
|
jsunity.run(namedGraphSuite);
|
|
jsunity.run(multiCollectionGraphSuite);
|
|
jsunity.run(potentialErrorsSuite);
|
|
jsunity.run(complexInternaSuite);
|
|
jsunity.run(complexFilteringSuite);
|
|
|
|
return jsunity.done();
|
|
|
|
}());
|