/*jslint indent: 2, nomen: true, maxlen: 80, sloppy: true */ /*global require, assertEqual, assertTrue, assertFalse, fail */ //////////////////////////////////////////////////////////////////////////////// /// @brief test the general-graph class /// /// @file /// /// DISCLAIMER /// /// Copyright 2010-2014 triagens 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 triAGENS GmbH, Cologne, Germany /// /// @author Florian Bartels, Michael Hackstein /// @author Copyright 2014, triAGENS GmbH, Cologne, Germany //////////////////////////////////////////////////////////////////////////////// var jsunity = require("jsunity"); var arangodb = require("org/arangodb"); var db = arangodb.db; var graph = require("org/arangodb/general-graph"); var ERRORS = arangodb.errors; var _ = require("underscore"); // ----------------------------------------------------------------------------- // --SECTION-- graph module // ----------------------------------------------------------------------------- //////////////////////////////////////////////////////////////////////////////// /// @brief test suite: general-graph Creation and edge definition //////////////////////////////////////////////////////////////////////////////// function GeneralGraphCreationSuite() { return { //////////////////////////////////////////////////////////////////////////////// /// @brief test: Graph Creation //////////////////////////////////////////////////////////////////////////////// test_undirectedRelationDefinition : function () { var r; try { r = graph._undirectedRelationDefinition("relationName", ["vertexC1", "vertexC2"]); } catch (err) { } assertEqual(r, { collection: "relationName", from: ["vertexC1", "vertexC2"], to: ["vertexC1", "vertexC2"] }); }, test_undirectedRelationDefinitionWithSingleCollection : function () { var r; try { r = graph._undirectedRelationDefinition("relationName", "vertexC1"); } catch (err) { } assertEqual(r, { collection: "relationName", from: ["vertexC1"], to: ["vertexC1"] }); }, test_undirectedRelationDefinitionWithMissingName : function () { var r, exception; try { r = graph._undirectedRelationDefinition("", ["vertexC1", "vertexC2"]); } catch (err) { exception = err; } assertEqual(exception, " must be a not empty string"); }, test_undirectedRelationDefinitionWithTooFewArgs : function () { var r, exception; try { r = graph._undirectedRelationDefinition(["vertexC1", "vertexC2"]); } catch (err) { exception = err; } assertEqual(exception, "method _undirectedRelationDefinition expects 2 arguments"); }, test_undirectedRelationDefinitionWithInvalidSecondArg : function () { var r, exception; try { r = graph._undirectedRelationDefinition("name", {"vertexC1" : "vertexC2"}); } catch (err) { exception = err; } assertEqual(exception, " must be a not empty string or array"); }, test_directedRelationDefinition : function () { var r; try { r = graph._directedRelationDefinition("relationName", ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"]); } catch (err) { } assertEqual(r, { collection: "relationName", from: ["vertexC1", "vertexC2"], to: ["vertexC3", "vertexC4"] }); }, test_directedRelationDefinitionWithMissingName : function () { var r, exception; try { r = graph._directedRelationDefinition("", ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"]); } catch (err) { exception = err; } assertEqual(exception, " must be a not empty string"); }, test_directedRelationDefinitionWithTooFewArgs : function () { var r, exception; try { r = graph._directedRelationDefinition(["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"]); } catch (err) { exception = err; } assertEqual(exception, "method _directedRelationDefinition expects 3 arguments"); }, test_directedRelationDefinitionWithInvalidSecondArg : function () { var r, exception; try { r = graph._directedRelationDefinition("name", {"vertexC1" : "vertexC2"}, ""); } catch (err) { exception = err; } assertEqual(exception, " must be a not empty string or array"); }, test_directedRelationDefinitionWithInvalidThirdArg : function () { var r, exception; try { r = graph._directedRelationDefinition("name", ["vertexC1", "vertexC2"], []); } catch (err) { exception = err; } assertEqual(exception, " must be a not empty string or array"); }, testEdgeDefinitions : function () { //with empty args assertEqual(graph.edgeDefinitions(), []); //with args assertEqual(graph.edgeDefinitions( graph._undirectedRelationDefinition("relationName", "vertexC1"), graph._directedRelationDefinition("relationName", ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"]) ), [ { collection: "relationName", from: ["vertexC1"], to: ["vertexC1"] }, { collection: "relationName", from: ["vertexC1", "vertexC2"], to: ["vertexC3", "vertexC4"] } ]); }, test_create : function () { try { arangodb.db._collection("_graphs").remove("_graphs/bla3") } catch (err) { } var a = graph._create( "bla3", graph.edgeDefinitions( graph._undirectedRelationDefinition("relationName", "vertexC1"), graph._directedRelationDefinition("relationName2", ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"] ) ) ); assertTrue(a.__vertexCollections.hasOwnProperty('vertexC1')); assertTrue(a.__vertexCollections.hasOwnProperty('vertexC2')); assertTrue(a.__vertexCollections.hasOwnProperty('vertexC3')); assertTrue(a.__vertexCollections.hasOwnProperty('vertexC4')); assertTrue(a.__edgeCollections.hasOwnProperty('relationName')); assertTrue(a.__edgeCollections.hasOwnProperty('relationName2')); assertEqual(a.__edgeDefinitions, [ { "collection" : "relationName", "from" : [ "vertexC1" ], "to" : [ "vertexC1" ] }, { "collection" : "relationName2", "from" : [ "vertexC1", "vertexC2" ], "to" : [ "vertexC3", "vertexC4" ] } ] ); }, test_create_WithOut_EdgeDefiniton : function () { var msg; try { arangodb.db._collection("_graphs").remove("_graphs/bla3") } catch (err) { } try { var a = graph._create( "bla3", [] ); } catch (err) { msg = err; } assertEqual(msg, "at least one edge definition is required to create a graph."); }, test_create_WithOut_Name : function () { var msg; try { arangodb.db._collection("_graphs").remove("_graphs/bla3") } catch (err) { } try { var a = graph._create( "", graph.edgeDefinitions( graph._undirectedRelationDefinition("relationName", "vertexC1"), graph._directedRelationDefinition("relationName2", ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"] ) ) ); } catch (err) { msg = err; } assertEqual(msg, "a graph name is required to create a graph."); }, test_create_With_Already_Existing_Graph : function () { try { arangodb.db._collection("_graphs").remove("_graphs/bla3") } catch (err) { } graph._create( "bla3", graph.edgeDefinitions( graph._undirectedRelationDefinition("relationName", "vertexC1"), graph._directedRelationDefinition("relationName2", ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"] ) ) ); var msg; try { var a = graph._create( "bla3", graph.edgeDefinitions( graph._undirectedRelationDefinition("relationName", "vertexC1"), graph._directedRelationDefinition("relationName2", ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"] ) ) ); } catch (err) { msg = err; } assertEqual(msg, "graph bla3 already exists."); }, test_get_graph : function () { try { arangodb.db._collection("_graphs").remove("_graphs/bla3") } catch (err) { } graph._create( "bla3", graph.edgeDefinitions( graph._undirectedRelationDefinition("relationName", "vertexC1"), graph._directedRelationDefinition("relationName2", ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"] ) ) ); var a = graph._graph("bla3"); assertTrue(a.__vertexCollections.hasOwnProperty('vertexC1')); assertTrue(a.__vertexCollections.hasOwnProperty('vertexC2')); assertTrue(a.__vertexCollections.hasOwnProperty('vertexC3')); assertTrue(a.__vertexCollections.hasOwnProperty('vertexC4')); assertTrue(a.__edgeCollections.hasOwnProperty('relationName')); assertTrue(a.__edgeCollections.hasOwnProperty('relationName2')); assertEqual(a.__edgeDefinitions, [ { "collection" : "relationName", "from" : [ "vertexC1" ], "to" : [ "vertexC1" ] }, { "collection" : "relationName2", "from" : [ "vertexC1", "vertexC2" ], "to" : [ "vertexC3", "vertexC4" ] } ] ); }, test_get_graph_without_hit : function () { var msg; try { var a = graph._graph("bla4"); } catch (e) { msg = e; } assertEqual(msg, "graph bla4 does not exists."); } }; } // ----------------------------------------------------------------------------- // --SECTION-- Simple Queries // ----------------------------------------------------------------------------- function GeneralGraphAQLQueriesSuite() { var dropInclExcl = function() { var col = db._collection("_graphs"); try { col.remove("graph"); } catch (e) { return; } var colList = ["v1", "v2", "v3", "included", "excluded"]; _.each(colList, function(c) { var colToClear = db._collection(c); if (col) { colToClear.truncate(); } }); }; var e1, e2, e3; var createInclExcl = function() { dropInclExcl(); var inc = graph._directedRelationDefinition( "included", ["v1"], ["v1", "v2"] ); var exc = graph._directedRelationDefinition( "excluded", ["v1"], ["v3"] ); var g = graph._create("graph", [inc, exc]); g.v1.save({_key: "1"}); g.v1.save({_key: "2"}); g.v2.save({_key: "1"}); g.v3.save({_key: "1"}); e1 = g.included.save( "v1/1", "v2/1", { _key: "e1", val: true } )._id; e2 = g.included.save( "v1/2", "v1/1", { _key: "e2", val: false } )._id; e3 = g.excluded.save( "v1/1", "v3/1", { _key: "e3", val: false } )._id; return g; }; var findIdInResult = function(result, id) { return _.some(result, function(i) { return i._id === id; }); }; // The testee graph object var g; return { //////////////////////////////////////////////////////////////////////////////// /// @brief setUp: query creation for edges //////////////////////////////////////////////////////////////////////////////// setUp: function() { g = createInclExcl(); }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: query creation for edges //////////////////////////////////////////////////////////////////////////////// tearDown: function() { dropInclExcl(); }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: query creation for edges //////////////////////////////////////////////////////////////////////////////// test_edges: function() { var query = g._edges("v1/1"); assertEqual(query.printQuery(), 'FOR edges_0 IN GRAPH_EDGES(' + '@graphName,@startVertex_0,"any")'); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); var result = query.toArray(); assertEqual(result.length, 3); assertTrue(findIdInResult(result, e1), "Did not include e1"); assertTrue(findIdInResult(result, e2), "Did not include e2"); assertTrue(findIdInResult(result, e3), "Did not include e3"); }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: query creation for outEdges //////////////////////////////////////////////////////////////////////////////// test_outEdges: function() { var query = g._outEdges("v1/1"); assertEqual(query.printQuery(), "FOR edges_0 IN GRAPH_EDGES(" + '@graphName,@startVertex_0,"outbound")'); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); var result = query.toArray(); assertEqual(result.length, 2); assertTrue(findIdInResult(result, e1), "Did not include e1"); assertTrue(findIdInResult(result, e3), "Did not include e3"); assertFalse(findIdInResult(result, e2), "e2 is not excluded"); }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: query creation for inEdges //////////////////////////////////////////////////////////////////////////////// test_inEdges: function() { var query = g._inEdges("v1/1"); assertEqual(query.printQuery(), "FOR edges_0 IN GRAPH_EDGES(" + '@graphName,@startVertex_0,"inbound")'); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); var result = query.toArray(); assertEqual(result.length, 1); assertTrue(findIdInResult(result, e2), "Did not include e2"); assertFalse(findIdInResult(result, e1), "e1 is not excluded"); assertFalse(findIdInResult(result, e3), "e3 is not excluded"); }, test_restrictOnEdges: function() { var query = g._edges("v1/1").restrict("included"); assertEqual(query.printQuery(), "FOR edges_0 IN GRAPH_EDGES(" + '@graphName,@startVertex_0,"any",{},@restrictions_0)'); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); assertEqual(bindVars.restrictions_0, ["included"]); var result = query.toArray(); assertEqual(result.length, 2); assertTrue(findIdInResult(result, e1), "Did not include e1"); assertTrue(findIdInResult(result, e2), "Did not include e2"); assertFalse(findIdInResult(result, e3), "e3 is not excluded"); }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: restrict construct on inEdges //////////////////////////////////////////////////////////////////////////////// test_restrictOnInEdges: function() { var query = g._inEdges("v1/1").restrict("included"); assertEqual(query.printQuery(), "FOR edges_0 IN GRAPH_EDGES(" + '@graphName,@startVertex_0,"inbound",{},@restrictions_0)'); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); assertEqual(bindVars.restrictions_0, ["included"]); var result = query.toArray(); assertEqual(result.length, 1); assertTrue(findIdInResult(result, e2), "Did not include e2"); assertFalse(findIdInResult(result, e1), "e1 is not excluded"); assertFalse(findIdInResult(result, e3), "e3 is not excluded"); }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: restrict construct on outEdges //////////////////////////////////////////////////////////////////////////////// test_restrictOnOutEdges: function() { var query = g._outEdges("v1/1").restrict("included"); assertEqual(query.printQuery(), "FOR edges_0 IN GRAPH_EDGES(" + '@graphName,@startVertex_0,"outbound",{},@restrictions_0)'); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); assertEqual(bindVars.restrictions_0, ["included"]); var result = query.toArray(); assertEqual(result.length, 1); assertTrue(findIdInResult(result, e1), "Did not include e1"); assertFalse(findIdInResult(result, e2), "e2 is not excluded"); assertFalse(findIdInResult(result, e3), "e3 is not excluded"); }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: restrict error handling //////////////////////////////////////////////////////////////////////////////// test_restrictErrorHandlingSingle: function() { try { g._outEdges("v1/1").restrict(["included", "unknown"]); fail(); } catch (err) { assertEqual(err.errorNum, ERRORS.ERROR_BAD_PARAMETER.code); assertEqual(err.errorMessage, "edge collections: unknown are not known to the graph"); } }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: restrict error handling on multiple failures //////////////////////////////////////////////////////////////////////////////// test_restrictErrorHandlingMultiple: function() { try { g._outEdges("v1/1").restrict(["failed", "included", "unknown", "foxxle"]); fail(); } catch (err) { assertEqual(err.errorNum, ERRORS.ERROR_BAD_PARAMETER.code); assertEqual(err.errorMessage, "edge collections: failed and unknown and foxxle are not known to the graph"); } }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: filter construct on Edges //////////////////////////////////////////////////////////////////////////////// test_filterOnEdges: function() { var query = g._edges("v1/1").filter({val: true}); // var query = g._edges("v1/1").filter("e.val = true"); assertEqual(query.printQuery(), "FOR edges_0 IN GRAPH_EDGES(" + '@graphName,@startVertex_0,"any") ' + 'FILTER MATCHES(edges_0,[{"val":true}])'); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); var result = query.toArray(); assertEqual(result.length, 1); assertTrue(findIdInResult(result, e1), "Did not include e1"); assertFalse(findIdInResult(result, e2), "e2 is not excluded"); assertFalse(findIdInResult(result, e3), "e3 is not excluded"); }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: filter construct on InEdges //////////////////////////////////////////////////////////////////////////////// test_filterOnInEdges: function() { var query = g._inEdges("v1/1").filter({val: true}); assertEqual(query.printQuery(), "FOR edges_0 IN GRAPH_EDGES(" + '@graphName,@startVertex_0,"inbound") ' + 'FILTER MATCHES(edges_0,[{"val":true}])'); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); var result = query.toArray(); assertEqual(result.length, 0); assertFalse(findIdInResult(result, e1), "e1 is not excluded"); assertFalse(findIdInResult(result, e2), "e2 is not excluded"); assertFalse(findIdInResult(result, e3), "e3 is not excluded"); }, //////////////////////////////////////////////////////////////////////////////// /// @brief test: filter construct on OutEdges //////////////////////////////////////////////////////////////////////////////// test_filterOnOutEdges: function() { var query = g._outEdges("v1/1").filter({val: true}); // var query = g._outEdges("v1/1").filter("e.val = true"); assertEqual(query.printQuery(), "FOR edges_0 IN GRAPH_EDGES(" + '@graphName,@startVertex_0,"outbound") ' + 'FILTER MATCHES(edges_0,[{"val":true}])'); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); var result = query.toArray(); assertEqual(result.length, 1); assertTrue(findIdInResult(result, e1), "Did not include e1"); assertFalse(findIdInResult(result, e2), "e2 is not excluded"); assertFalse(findIdInResult(result, e3), "e3 is not excluded"); } //////////////////////////////////////////////////////////////////////////////// /// @brief test: let construct on edges //////////////////////////////////////////////////////////////////////////////// /* Broken string replacement test_letOnEdges: function() { var query = g._edges("v1/1").let("myVal = e.val"); assertEqual(query.printQuery(), "FOR edges_0 IN GRAPH_EDGES(" + "@graphName,@startVertex_0,any) LET myVal = edges_0.val"); var bindVars = query.bindVars; assertEqual(bindVars.graphName, "graph"); assertEqual(bindVars.startVertex_0, "v1/1"); */ /* var result = query.toArray(); assertEqual(result.length, 1); assertTrue(findIdInResult(result, e3)); assertFalse(findIdInResult(result, e1)); assertFalse(findIdInResult(result, e2)); */ /* } */ }; } function EdgesAndVerticesSuite() { var g; var vertexIds = []; var vertexId1, vertexId2; var edgeId1, edgeId2; fillCollections = function() { var ids = {}; var vertex = g.unitTestVertexCollection1.save({first_name: "Tam"}); ids["vId11"] = vertex._id; vertex = g.unitTestVertexCollection1.save({first_name: "Tem"}); ids["vId12"] = vertex._id; vertex = g.unitTestVertexCollection1.save({first_name: "Tim"}); ids["vId13"] = vertex._id; vertex = g.unitTestVertexCollection1.save({first_name: "Tom"}); ids["vId14"] = vertex._id; vertex = g.unitTestVertexCollection1.save({first_name: "Tum"}); ids["vId15"] = vertex._id; vertex = g.unitTestVertexCollection3.save({first_name: "Tam"}); ids["vId31"] = vertex._id; vertex = g.unitTestVertexCollection3.save({first_name: "Tem"}); ids["vId32"] = vertex._id; vertex = g.unitTestVertexCollection3.save({first_name: "Tim"}); ids["vId33"] = vertex._id; vertex = g.unitTestVertexCollection3.save({first_name: "Tom"}); ids["vId34"] = vertex._id; vertex = g.unitTestVertexCollection3.save({first_name: "Tum"}); ids["vId35"] = vertex._id; var edge = g.unitTestEdgeCollection1.save(ids.vId11, ids.vId12, {}); ids["eId11"] = edge._id; edge = g.unitTestEdgeCollection1.save(ids.vId11, ids.vId13, {}); ids["eId12"] = edge._id; edge = g.unitTestEdgeCollection1.save(ids.vId11, ids.vId14, {}); ids["eId13"] = edge._id; edge = g.unitTestEdgeCollection1.save(ids.vId11, ids.vId15, {}); ids["eId14"] = edge._id; edge = g.unitTestEdgeCollection1.save(ids.vId12, ids.vId11, {}); ids["eId15"] = edge._id; edge = g.unitTestEdgeCollection1.save(ids.vId13, ids.vId11, {}); ids["eId16"] = edge._id; edge = g.unitTestEdgeCollection1.save(ids.vId14, ids.vId11, {}); ids["eId17"] = edge._id; edge = g.unitTestEdgeCollection1.save(ids.vId15, ids.vId11, {}); ids["eId18"] = edge._id; edge = g.unitTestEdgeCollection2.save(ids.vId11, ids.vId31, {}); ids["eId21"] = edge._id; edge = g.unitTestEdgeCollection2.save(ids.vId11, ids.vId32, {}); ids["eId22"] = edge._id; edge = g.unitTestEdgeCollection2.save(ids.vId11, ids.vId33, {}); ids["eId23"] = edge._id; edge = g.unitTestEdgeCollection2.save(ids.vId11, ids.vId34, {}); ids["eId24"] = edge._id; edge = g.unitTestEdgeCollection2.save(ids.vId11, ids.vId35, {}); ids["eId25"] = edge._id; return ids; } return { setUp : function() { try { arangodb.db._collection("_graphs").remove("_graphs/unitTestGraph") } catch (err) { } g = graph._create( "unitTestGraph", graph.edgeDefinitions( graph._undirectedRelationDefinition("unitTestEdgeCollection1", "unitTestVertexCollection1"), graph._directedRelationDefinition("unitTestEdgeCollection2", ["unitTestVertexCollection1", "unitTestVertexCollection2"], ["unitTestVertexCollection3", "unitTestVertexCollection4"] ) ) ); }, tearDown : function() { db.unitTestVertexCollection1.drop(); db.unitTestVertexCollection2.drop(); db.unitTestVertexCollection3.drop(); db.unitTestVertexCollection4.drop(); db.unitTestEdgeCollection1.drop(); db.unitTestEdgeCollection2.drop(); }, test_edgeCollections : function () { var edgeCollections = g._edgeCollections(); assertEqual(edgeCollections[0].name(), 'unitTestEdgeCollection1'); assertEqual(edgeCollections[1].name(), 'unitTestEdgeCollection2'); }, test_vertexCollections : function () { var vertexCollections = g._vertexCollections(); assertEqual(vertexCollections[0].name(), 'unitTestVertexCollection1'); assertEqual(vertexCollections[1].name(), 'unitTestVertexCollection2'); assertEqual(vertexCollections[2].name(), 'unitTestVertexCollection3'); assertEqual(vertexCollections[3].name(), 'unitTestVertexCollection4'); }, test_vC_save : function () { var vertex = g.unitTestVertexCollection1.save({first_name: "Tom"}); assertFalse(vertex.error); vertexId1 = vertex._id; var vertexObj = g.unitTestVertexCollection1.document(vertexId1); assertEqual(vertexObj.first_name, "Tom"); }, test_vC_replace : function () { var vertex = g.unitTestVertexCollection1.save({first_name: "Tom"}); var vertexId = vertex._id; vertex = g.unitTestVertexCollection1.replace(vertexId, {first_name: "Tim"}); assertFalse(vertex.error); var vertexObj = g.unitTestVertexCollection1.document(vertexId); assertEqual(vertexObj.first_name, "Tim"); }, test_vC_update : function () { var vertex = g.unitTestVertexCollection1.save({first_name: "Tim"}); var vertexId = vertex._id; vertex = g.unitTestVertexCollection1.update(vertexId, {age: 42}); assertFalse(vertex.error); var vertexObj = g.unitTestVertexCollection1.document(vertexId); assertEqual(vertexObj.first_name, "Tim"); assertEqual(vertexObj.age, 42); }, test_vC_remove : function () { var vertex = g.unitTestVertexCollection1.save({first_name: "Tim"}); var vertexId = vertex._id; var vertex = g.unitTestVertexCollection1.remove(vertexId); assertTrue(vertex); }, test_eC_save_undirected : function() { var vertex1 = g.unitTestVertexCollection1.save({first_name: "Tom"}); var vertexId1 = vertex1._id; var vertex2 = g.unitTestVertexCollection1.save({first_name: "Tim"}); var vertexId2 = vertex2._id; var edge = g.unitTestEdgeCollection1.save(vertexId1, vertexId2, {}); assertFalse(edge.error); edgeId1 = edge._id; g.unitTestVertexCollection1.remove(vertexId1); g.unitTestVertexCollection1.remove(vertexId2); }, test_eC_save_directed : function() { var vertex1 = g.unitTestVertexCollection2.save({first_name: "Tom"}); vertexId1 = vertex1._id; var vertex2 = g.unitTestVertexCollection4.save({first_name: "Tim"}); vertexId2 = vertex2._id; var edge = g.unitTestEdgeCollection2.save(vertexId1, vertexId2, {}); assertFalse(edge.error); edgeId2 = edge._id; g.unitTestVertexCollection2.remove(vertexId1); g.unitTestVertexCollection4.remove(vertexId2); }, test_eC_save_withError : function() { var vertex1 = g.unitTestVertexCollection1.save({first_name: "Tom"}); vertexId1 = vertex1._id; var vertex2 = g.unitTestVertexCollection2.save({first_name: "Tim"}); vertexId2 = vertex2._id; try { var edge = g.unitTestEdgeCollection1.save(vertexId1, vertexId2, {}); } catch (e) { assertEqual(e, "Edge is not allowed between " + vertexId1 + " and " + vertexId2 + ".") } g.unitTestVertexCollection1.remove(vertexId1); g.unitTestVertexCollection2.remove(vertexId2); }, test_eC_replace : function() { var vertex1 = g.unitTestVertexCollection1.save({first_name: "Tom"}); var vertexId1 = vertex1._id; var vertex2 = g.unitTestVertexCollection1.save({first_name: "Tim"}); var vertexId2 = vertex2._id; var edge = g.unitTestEdgeCollection1.save(vertexId1, vertexId2, {}); var edgeId1 = edge._id; edge = g.unitTestEdgeCollection1.replace(edgeId1, {label: "knows"}); assertFalse(edge.error); var edgeObj = g.unitTestEdgeCollection1.document(edgeId1); assertEqual(edgeObj.label, "knows"); assertEqual(edgeObj._id, edgeId1); }, test_eC_update : function () { var vertex1 = g.unitTestVertexCollection1.save({first_name: "Tom"}); var vertexId1 = vertex1._id; var vertex2 = g.unitTestVertexCollection1.save({first_name: "Tim"}); var vertexId2 = vertex2._id; var edge = g.unitTestEdgeCollection1.save(vertexId1, vertexId2, {}); var edgeId1 = edge._id; edge = g.unitTestEdgeCollection1.replace(edgeId1, {label: "knows"}); edge = g.unitTestEdgeCollection1.update(edgeId1, {blub: "blub"}); assertFalse(edge.error); var edgeObj = g.unitTestEdgeCollection1.document(edgeId1); assertEqual(edgeObj.label, "knows"); assertEqual(edgeObj.blub, "blub"); assertEqual(edgeObj._id, edgeId1); }, test_eC_remove : function () { var vertex1 = g.unitTestVertexCollection1.save({first_name: "Tom"}); var vertexId1 = vertex1._id; var vertex2 = g.unitTestVertexCollection1.save({first_name: "Tim"}); var vertexId2 = vertex2._id; var edge = g.unitTestEdgeCollection1.save(vertexId1, vertexId2, {}); var edgeId1 = edge._id; edge = g.unitTestEdgeCollection1.remove(edgeId1); assertTrue(edge); }, test_edges : function() { var ids = fillCollections(); var result = g._edges(ids.vId11).toArray(); assertEqual(result.length, 13) }, test_inEdges : function() { var ids = fillCollections(); var result = g._inEdges(ids.vId11).toArray(); assertEqual(result.length, 4) }, test_outEdges : function() { var ids = fillCollections(); var result = g._outEdges(ids.vId11).toArray(); assertEqual(result.length, 9) }, test_getInVertex : function() { var ids = fillCollections(); var result = g._getInVertex(ids.eId11); assertEqual(result._id, ids.vId11); }, test_getOutVertex : function() { var ids = fillCollections(); var result = g._getOutVertex(ids.eId11); assertEqual(result._id, ids.vId12); result = g._getOutVertex(ids.eId25); assertEqual(result._id, ids.vId35); } }; } // ----------------------------------------------------------------------------- // --SECTION-- main // ----------------------------------------------------------------------------- //////////////////////////////////////////////////////////////////////////////// /// @brief executes the test suites //////////////////////////////////////////////////////////////////////////////// jsunity.run(EdgesAndVerticesSuite); jsunity.run(GeneralGraphCreationSuite); jsunity.run(GeneralGraphAQLQueriesSuite); return jsunity.done(); // Local Variables: // mode: outline-minor // outline-regexp: "^\\(/// @brief\\|/// @addtogroup\\|// --SECTION--\\|/// @page\\|/// @}\\)" // End: