1
0
Fork 0
Commit Graph

99 Commits

Author SHA1 Message Date
Jan Steemann 5c033f566b Merge branch 'devel' of https://github.com/arangodb/arangodb into vpack 2015-12-04 13:47:08 +01:00
Jan Steemann 785beaa625 cppcheck 2015-12-04 12:18:15 +01:00
Jan Steemann b8cd633276 Windows fixes 2015-12-03 15:00:19 +01:00
Michael Hackstein 23e2ac5da7 Fixed status reporting for Cluster and Single Server Case for the AQL Traverser Node. 2015-12-02 17:20:09 +01:00
Michael Hackstein 1a13af6f36 Merged remote changes with local stash 2015-12-02 11:34:58 +01:00
Jan Steemann 2bbcaa868f fixed invalid memory usages 2015-12-01 16:48:55 +01:00
Michael Hackstein a7b7d1ec18 Adapted traverser implementations to new Path Enumerator for improved pruning 2015-11-27 16:25:02 +01:00
Jan Steemann db078f1554 changed some APIs of AssocMulti 2015-11-25 15:40:01 +01:00
Michael Hackstein aa8e1daaf7 Moved String->VertexId conversion into the general traverser. It is required outside of V8Server 2015-11-24 10:24:19 +01:00
Michael Hackstein 001dd4debf The local traverser now early filters on vertices 2015-11-18 16:14:17 +01:00
Michael Hackstein 201c54e6b0 Removed unnecessary constructors 2015-11-18 15:32:04 +01:00
Michael Hackstein 1f6519b01e Using early abortion in local Traverser for AQL. Now it's cluster time 2015-11-18 14:50:03 +01:00
Michael Hackstein 0adbef4f76 Transformed the TraversalExpression vector into a map ordered by access level. This is way more convenient on the Traverser side to be used. 2015-11-17 16:25:45 +01:00
Michael Hackstein e24135df09 Extracted some more common functionality from V8 and Cluster Traverser to the abstract class 2015-11-13 14:54:32 +01:00
Michael Hackstein b7a8a364fc Started Including the Cluster Traversal in AQL. Right now the result is empty but the server will not crash any more. Now starting with the real implementation. 2015-11-13 11:08:18 +01:00
Michael Hackstein 8d0d921ab6 Included two Abstract classes for Traversals. Traverser and TraversalPath. Implemented both of them for Single-Server Traversals. 2015-11-12 16:25:36 +01:00
Wilfried Goesgens cd6cc35def Adjust the stage to the now non-void pointered index implementation. 2015-10-22 11:12:21 +02:00
Wilfried Goesgens dae95de667 Merge branch 'devel' of github.com:arangodb/ArangoDB into JHMH 2015-10-21 14:54:01 +02:00
Jan Steemann 0ea2247eb0 scan-build 2015-09-30 17:28:52 +02:00
Michael Hackstein 1a7f414c16 Merge branch 'devel' of github.com:arangodb/arangodb into JHMH 2015-09-18 12:21:39 +02:00
Frank Celler c4d1fff729 new traversal 2015-09-18 10:40:28 +02:00
CoDEmanX 3a9648d78a More Americanization 2015-09-03 22:25:43 +02:00
Jan Steemann 6d7ccd7699 move shaper to cxx 2015-07-28 17:38:31 +02:00
Michael Hackstein 89ca3f68b9 Fixed edgeExamples in CPPOnly Neighbors function 2015-07-23 16:08:32 +02:00
Michael Hackstein 84174aa99a Added edgeExamples functionality to CPPonly Neighbors. 2015-07-23 15:25:50 +02:00
Michael Hackstein f92c3b21ce Removed the duplicate distinct / result listing in Neighbors 2015-07-22 17:11:38 +02:00
Michael Hackstein df33ffe410 Added an implementation for shortest path which allows to take shortcuts iff we do not have to access the data, f.e. filtering or distances. Gives an enormous speedup. 2015-07-13 11:31:42 +02:00
Jan Steemann a51c258bf5 fixed memleaks 2015-06-01 14:56:14 +02:00
Michael Hackstein f15e56171b Implemented min/maxDepth for neighbors in CPP layer. And removed the option for non-distinct neighbors. 2015-05-28 15:10:14 -07:00
Michael Hackstein 5e5c5fca70 Added neighbor examples and edge examples to CXX Neighbors. The ExampleMatcher is NOT able to match internal attributes yet. 2015-05-27 13:40:30 -07:00
Michael Hackstein 8b1cef7f76 CPP Neighbors is now able to take an array of examples instead of only a single one. 2015-05-26 09:51:04 -07:00
Michael Hackstein 76c33a577c Neighbors is now able to take exactly one edge example onto the CPP level. Now working on a list of examples 2015-05-25 12:39:44 -07:00
Max Neunhoeffer ad7b73480f Make CPP_NEIGHBORS more flexible. 2015-05-23 20:10:16 -07:00
Michael Hackstein 0b8e9eb59c Fixed minor inconsistency in AQL NEIGHBORS and adapted tests to the new version. It will now Return the list of vertices. not the pair<edge, vertex> any more 2015-05-22 15:30:24 -07:00
Jan Steemann b9326a251e fix path 2015-05-20 09:41:26 +02:00
Michael Hackstein 8494ddb85d The shortest_path now allows to use vertexExample and edgeExamples. Also it allows t add additional vertex and edge collections in the options. If you want to use vertexExample and your edge collection is pointing to other vertex collections then the on in the first parameter you have to give the additional collection in the options 2015-05-19 14:26:14 -07:00
Michael Hackstein d832a7579a The new shortest path is now able to take exactly one edge example. Has to be improved to use a list of examples 2015-05-15 15:08:17 -07:00
Michael Hackstein 7ba7482d58 Implemented an ExampleMatcher class to be used for path filtering. Is now used in byExample queries as well. API not fixed yet. 2015-05-14 13:29:42 -07:00
Michael Hackstein c785388366 Shortest path is now able to either return data or ids. Also if collections not known beforehand are found on the path 2015-05-12 12:07:11 -07:00
Michael Hackstein efaccccb4e The Shortest path is now able to handle graphs with several vertex collections, but only one edge collection. 2015-05-10 20:38:25 -07:00
Michael Hackstein 3cbac8ae25 The Neighbors can now be requested distinct. However this is not introduced to AQL due to missing options parameter, would change API 2015-05-07 17:17:18 -07:00
Michael Hackstein 323d34f629 The new CPP neighbors now take all three directions 2015-05-07 16:33:05 -07:00
Michael Hackstein aef5432d31 Allowed he neighbors function to switch between data and ids only 2015-05-06 16:00:35 -07:00
Michael Hackstein b89c28e141 Now allows the new CPP traversal to contain the vertex data. Edgedata is yet to come 2015-05-05 22:49:37 -07:00
Michael Hackstein 4c7b9459d5 The cpp shortest path now returns _id instead of _key. First implementation of cpp neighbors. Returns only vertexIds now. 2015-05-03 00:13:30 -07:00
Michael Hackstein ca0de62aa3 Moved all v8 context sensitive parts into from V8Traverser v8-vocbase 2015-05-02 21:46:54 -07:00
Max Neunhoeffer 97f7743d84 Less copying in Traverser. 2015-05-02 06:28:52 +02:00
Michael Hackstein 6f81b0add1 Further implementation of Shortest Path. The Shortest path is found in cpp conversion to JS not yet working 2015-04-25 21:35:40 -07:00
Michael Hackstein 9f1830b4c5 Started implementing the Expander function. Not et finished does not compile but i am moving over to a new machine 2015-04-25 21:34:41 -07:00