1
0
Fork 0
Commit Graph

26 Commits

Author SHA1 Message Date
Michael Hackstein aa1dc2a083 Intermediate State: Moved Traversals to use Slices above Strings to compare. Also Preperation to use different indexes. This state compiles but is not functional. 2016-07-19 10:54:37 +02:00
Michael Hackstein 5b1e1b7496 Now the Traverser Node figures out the correct index handle. Next Up: SingleServerTraverser needs to use indexScan for this condition. Traversal Still out of function. 2016-07-15 17:14:03 +02:00
Michael Hackstein 36d579e20e Started rebuilding the traversal Condition. About to delete the TraverserExpression and entirely replacing it by AQL-Conditions. NOTE: This commit is not functional 2016-07-15 11:15:17 +02:00
Michael Hackstein b285cd26a3 Internal cleanup of TraversalOptions. Now the options know the the expressions not the traverser any more. Preparation to use other indexes 2016-07-06 22:42:46 +02:00
Michael Hackstein 12011060c0 Removed now obsolete code 2016-07-04 16:25:59 +02:00
Michael Hackstein d273b387f8 Improved Traversal internal API. It now does less copying and creates less objects. Also it is way simpler to understand. 2016-07-04 16:16:58 +02:00
Michael Hackstein 59dd29e760 Improved OperationCursor. It now uses unique instead of shared ptr. It was never shared anyways. Also many more places now use direct MasterPointers in favor of OperationResults. Also added a generic IndexIterator nextBabies function. 2016-06-29 13:08:07 +02:00
jsteemann 8f0991e18e potential performance optimizations
simplifications

small optimizations
2016-06-23 14:47:44 +02:00
jsteemann 55fce39574 optimizations for neighbors queries 2016-06-20 18:37:46 +02:00
jsteemann 6862f8fb9e micro optimizations 2016-06-17 17:55:06 +02:00
jsteemann 205cb4545a micro optimization 2016-06-17 17:10:15 +02:00
jsteemann 1e8ce63e01 optimizations for traversal 2016-06-17 16:27:37 +02:00
jsteemann 1eff077480 small changes 2016-06-16 18:06:51 +02:00
jsteemann ca4edc60e0 small optimizations for traversal 2016-06-16 13:26:46 +02:00
jsteemann 6683bc02a7 small traversal optimizations 2016-06-16 09:44:24 +02:00
jsteemann 174bbab03a less work when packing search values for documentFastPath() 2016-06-15 22:23:14 +02:00
jsteemann fc34a53b14 speed up 2016-06-15 09:38:45 +02:00
jsteemann 9abb3d6e72 do not count filtered values twice 2016-06-13 13:33:55 +02:00
jsteemann c580ac9b91 make it compile on Visual Studio 2016-06-13 13:18:57 +02:00
jsteemann 85d8e84e2a fixed endless looping 2016-06-13 12:15:30 +02:00
jsteemann 365a70643e use std::move 2016-06-13 10:28:39 +02:00
Michael Hackstein d7a710593a Fixed some minor bugs in breadth-first-search for AQL traversal. Also added another test case for it. 2016-06-10 21:00:38 +02:00
Michael Hackstein 50225fdc0d First draft of Breadth-First-Search implementation for Traversal. 2016-06-10 19:25:44 +02:00
Michael Hackstein bdee12804c PathEnumerator is now an Abstract class. It can either be DepthFirstEnumerator, or BreadthFirstEnumerator. The later is to be implemented 2016-06-10 15:41:20 +02:00
Michael Hackstein dce3864285 Further internal cleanup of Traversal and ShortestPath. wrt Template Classes. Also moved maxDepth test into the pathEnumerator in preparation for BreadthFirstTraversals 2016-06-10 15:03:27 +02:00
Michael Hackstein 419cfdab14 Cleanup of internal structur for single server traversals. Moved the functions out of V8Server because they do not have anything to do with V8 any more. It should be more clear now 2016-06-10 13:56:07 +02:00