mcollina/levelgraph

2014-04-10 09:16:14
10.0
29.0
24.0
15.0
1..132 not ok 1 basic join algorithm "before each" hook # tests 1 # pass 0 # fail 1
2014-03-19 10:06:22
10.0
✓29.0
✓24.0
15.0
1..132 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get it specifiying the subject and falsy params ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 92 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 93 a basic triple store with a triple inserted should return the triple through the getStream interface ok 94 a basic triple store with a triple inserted should return the triple through the getStream interface with falsy params ok 95 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 96 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 97 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 98 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 99 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 100 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject and a falsy predicate ok 101 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 102 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate and a falsy subject ok 103 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 104 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 106 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 107 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 108 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 109 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 110 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2
1..132 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get it specifiying the subject and falsy params ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 92 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 93 a basic triple store with a triple inserted should return the triple through the getStream interface ok 94 a basic triple store with a triple inserted should return the triple through the getStream interface with falsy params ok 95 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 96 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 97 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 98 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 99 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 100 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject and a falsy predicate ok 101 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 102 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate and a falsy subject ok 103 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 104 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 106 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 107 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 108 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 109 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 110 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 111 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 112 a basic triple store API deprecations should call searchStream when calling joinStream ok 113 a basic triple store API deprecations should alias search to join ok 114 a basic triple store API deprecations should warn when calling joinStream ok 115 a basic triple store API deprecations should warn when calling join ok 116 deferred open support should call the callback if a level is passed ok 117 deferred open support should call the callback if a level is not passed ok 118 deferred open support should call the callback with a levelgrap ok 119 deferred open support should support deferred search ok 120 generateBatch should generate a batch from a triple ok 121 generateBatch should generate a batch of type ok 122 Variable should have a name ok 123 Variable should have a name (bis) ok 124 Variable isBound should return true if there is a key in the solution ok 125 Variable isBound should return false if there is no key in the solution ok 126 Variable isBound should return false if there is another key in the solution ok 127 Variable bind should return a different object ok 128 Variable bind should set an element in the solution ok 129 Variable bind should copy values ok 130 Variable isBindable should bind to the same value ok 131 Variable isBindable should not bind to a different value ok 132 Variable isBindable should bind if the key is not present # tests 132 # pass 132 # fail 0
1..132 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get it specifiying the subject and falsy params ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 92 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 93 a basic triple store with a triple inserted should return the triple through the getStream interface ok 94 a basic triple store with a triple inserted should return the triple through the getStream interface with falsy params ok 95 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 96 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 97 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 98 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 99 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 100 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject and a falsy predicate ok 101 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 102 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate and a falsy subject ok 103 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 104 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 106 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 107 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 108 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 109 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 110 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 111 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 112 a basic triple store API deprecations should call searchStream when calling joinStream ok 113 a basic triple store API deprecations should alias search to join ok 114 a basic triple store API deprecations should warn when calling joinStream ok 115 a basic triple store API deprecations should warn when calling join ok 116 deferred open support should call the callback if a level is passed ok 117 deferred open support should call the callback if a level is not passed ok 118 deferred open support should call the callback with a levelgrap ok 119 deferred open support should support deferred search ok 120 generateBatch should generate a batch from a triple ok 121 generateBatch should generate a batch of type ok 122 Variable should have a name ok 123 Variable should have a name (bis) ok 124 Variable isBound should return true if there is a key in the solution ok 125 Variable isBound should return false if there is no key in the solution ok 126 Variable isBound should return false if there is another key in the solution ok 127 Variable bind should return a different object ok 128 Variable bind should set an element in the solution ok 129 Variable bind should copy values ok 130 Variable isBindable should bind to the same value ok 131 Variable isBindable should not bind to a different value ok 132 Variable isBindable should bind if the key is not present # tests 132 # pass 132 # fail 0
1..132 not ok 1 basic join algorithm "before each" hook # tests 1 # pass 0 # fail 1
2014-02-25 09:25:00
10.0
✓29.0
✓24.0
15.0
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 generateBatch should generate a batch from a triple ok 117 generateBatch should generate a batch of type ok 118 Variable should have a name ok 119 Variable should have a name (bis) ok 120 Variable isBound should return true if there is a key in the solution ok 121 Variable isBound should return false if there is no key in the solution ok 122 Variable isBound should return false if there is another key in the solution ok 123 Variable bind should return a different object ok 124 Variable bind should set an element in the solution ok 125 Variable bind should copy values ok 126 Variable isBindable should bind to the same value ok 127 Variable isBindable should not bind to a different value ok 128 Variable isBindable should bind if the key is not present # tests 128 # pass 128 # fail 0
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 generateBatch should generate a batch from a triple ok 117 generateBatch should generate a batch of type ok 118 Variable should have a name ok 119 Variable should have a name (bis) ok 120 Variable isBound should return true if there is a key in the solution ok 121 Variable isBound should return false if there is no key in the solution ok 122 Variable isBound should return false if there is another key in the solution ok 123 Variable bind should return a different object ok 124 Variable bind should set an element in the solution ok 125 Variable bind should copy values ok 126 Variable isBindable should bind to the same value ok 127 Variable isBindable should not bind to a different value ok 128 Variable isBindable should bind if the key is not present # tests 128 # pass 128 # fail 0
not ok 1 Error: Syntax error on line 17212
2014-02-10 09:05:43
10.0
29.0
24.0
15.0
idle timeout: 30 seconds with no output
not ok 1 Error: Syntax error on line 19400
2014-02-02 23:12:16
10.0
29.0
24.0
15.0
1..128 not ok 1 basic join algorithm should do a join with one results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 2 basic join algorithm should do a join with two results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 3 basic join algorithm should do a join with three conditions Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 4 basic join algorithm should return the two solutions through the searchStream interface Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 5 basic join algorithm should allow to find mutual friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 6 basic join algorithm should allow to intersect common friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 7 basic join algorithm should support the friend of a friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 8 basic join algorithm should return triples from a join aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 10 basic join algorithm should emit triples from the stream interface aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 11 basic join algorithm should support filtering inside a condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 12 basic join algorithm should support filtering inside a second-level condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 13 basic join algorithm should support solution filtering Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 14 basic join algorithm should return only one solution with limit 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 15 basic join algorithm should return only one solution with limit 1 (bis) Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 16 basic join algorithm should return skip the first solution with offset 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 17 basic join algorithm should find homes in paris Error: Uncaught Error: Not implemented (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512) at global.onerror (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/node_modules/mocha/mocha.js:5622:10) ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex not ok 21 navigator should follow an arch going out a vertex Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 22 navigator should follow an arch going in a vertex Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 23 navigator should follow multiple archs, in and out a path Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 24 navigator should follow multiple archs, in and out a path using a stream Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 25 navigator should allow to set the name of the variables Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 26 navigator should allow to bind a variable Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 27 navigator should allow to start the navigation from a variable Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 28 navigator should return the solutions Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 29 navigator should return the solution as a stream Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) ok 30 navigator should return no solution if no condition is specified not ok 31 navigator should return the materialized triples Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 32 navigator should return the materialized triples as a stream Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 33 navigator should go to another vertex Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 34 navigator should go to another vertex as a variable Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) not ok 54 sort join algorithm should do a join with one results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 55 sort join algorithm should do a join with two results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 56 sort join algorithm should do a join with three conditions Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 57 sort join algorithm should return the two solutions through the searchStream interface Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 58 sort join algorithm should allow to find mutual friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 59 sort join algorithm should allow to intersect common friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 60 sort join algorithm should support the friend of a friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 61 sort join algorithm should return triples from a join aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 63 sort join algorithm should emit triples from the stream interface aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 64 sort join algorithm should support filtering inside a condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 65 sort join algorithm should support filtering inside a second-level condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 66 sort join algorithm should support solution filtering Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 67 sort join algorithm should return only one solution with limit 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 68 sort join algorithm should return only one solution with limit 1 (bis) Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 69 sort join algorithm should return skip the first solution with offset 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15846:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:18200:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:575:10) at http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1307:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1228:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:1306:9) at planner (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:571:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:292:5) not ok 70 sort join algorithm should find homes in paris Error: Uncaught Error: Not implemented (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/1391381758452.901bbc67.js:15512) at global.onerror (http://git.testling.com/work/mcollina/repos/3282a5ae8e51b919ca991a8ecb1890c77504893f.1391381757575/node_modules/mocha/mocha.js:5622:10) ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream
not ok 1 Error: Syntax error on line 19140
2014-01-27 09:10:16
10.0
✓29.0
✓24.0
15.0
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 generateBatch should generate a batch from a triple ok 117 generateBatch should generate a batch of type ok 118 Variable should have a name ok 119 Variable should have a name (bis) ok 120 Variable isBound should return true if there is a key in the solution ok 121 Variable isBound should return false if there is no key in the solution ok 122 Variable isBound should return false if there is another key in the solution ok 123 Variable bind should return a different object ok 124 Variable bind should set an element in the solution ok 125 Variable bind should copy values ok 126 Variable isBindable should bind to the same value ok 127 Variable isBindable should not bind to a different value ok 128 Variable isBindable should bind if the key is not present # tests 128 # pass 128 # fail 0
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 generateBatch should generate a batch from a triple ok 117 generateBatch should generate a batch of type ok 118 Variable should have a name ok 119 Variable should have a name (bis) ok 120 Variable isBound should return true if there is a key in the solution ok 121 Variable isBound should return false if there is no key in the solution ok 122 Variable isBound should return false if there is another key in the solution ok 123 Variable bind should return a different object ok 124 Variable bind should set an element in the solution ok 125 Variable bind should copy values ok 126 Variable isBindable should bind to the same value ok 127 Variable isBindable should not bind to a different value ok 128 Variable isBindable should bind if the key is not present # tests 128 # pass 128 # fail 0
not ok 1 Error: Syntax error on line 17154
2014-01-26 21:09:34
10.0
✓29.0
✓24.0
15.0
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 generateBatch should generate a batch from a triple ok 117 generateBatch should generate a batch of type ok 118 Variable should have a name ok 119 Variable should have a name (bis) ok 120 Variable isBound should return true if there is a key in the solution ok 121 Variable isBound should return false if there is no key in the solution ok 122 Variable isBound should return false if there is another key in the solution ok 123 Variable bind should return a different object ok 124 Variable bind should set an element in the solution ok 125 Variable bind should copy values ok 126 Variable isBindable should bind to the same value ok 127 Variable isBindable should not bind to a different value ok 128 Variable isBindable should bind if the key is not present # tests 128 # pass 128 # fail 0
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 generateBatch should generate a batch from a triple ok 117 generateBatch should generate a batch of type ok 118 Variable should have a name ok 119 Variable should have a name (bis) ok 120 Variable isBound should return true if there is a key in the solution ok 121 Variable isBound should return false if there is no key in the solution ok 122 Variable isBound should return false if there is another key in the solution ok 123 Variable bind should return a different object ok 124 Variable bind should set an element in the solution ok 125 Variable bind should copy values ok 126 Variable isBindable should bind to the same value ok 127 Variable isBindable should not bind to a different value ok 128 Variable isBindable should bind if the key is not present # tests 128 # pass 128 # fail 0
not ok 1 Error: Syntax error on line 17154
2014-01-21 08:23:29
10.0
✓29.0
24.0
15.0
1..133 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 a multileveled triple store should put a triple ok 21 a multileveled triple store should get a triple ok 22 a multileveled triple store should search a triple ok 23 a multileveled triple store should put a triple with a stream # SKIP - ok 24 a multileveled triple store should not close anything ok 25 navigator should navigate to a single vertex ok 26 navigator should follow an arch going out a vertex ok 27 navigator should follow an arch going in a vertex ok 28 navigator should follow multiple archs, in and out a path ok 29 navigator should follow multiple archs, in and out a path using a stream ok 30 navigator should allow to set the name of the variables ok 31 navigator should allow to bind a variable ok 32 navigator should allow to start the navigation from a variable ok 33 navigator should return the solutions ok 34 navigator should return the solution as a stream ok 35 navigator should return no solution if no condition is specified ok 36 navigator should return the materialized triples ok 37 navigator should return the materialized triples as a stream ok 38 navigator should go to another vertex ok 39 navigator should go to another vertex as a variable ok 40 navigator should alias solutions to contexts ok 41 navigator should alias solutionStream to contextStream ok 42 a basic triple store should put some more data inside a triple ok 43 a basic triple store should return the inserted data ok 44 query planner with basic algorithm should return a single condition as-is ok 45 query planner with basic algorithm should order two conditions based on their size ok 46 query planner with basic algorithm should order two conditions based on their size (bis) ok 47 query planner with basic algorithm should avoid variables ok 48 query planner with sort algorithm should return a single condition with the JoinStream ok 49 query planner with sort algorithm should put the second condition in the same order as the first ok 50 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 51 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 52 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 53 query planner with sort algorithm should put the variables from the previous condition in the same order ok 54 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 55 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 56 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 57 query planner without approximateSize should order two conditions based on their size ok 58 query planner without approximateSize should order two conditions based on their size (bis) ok 59 sort join algorithm should do a join with one results ok 60 sort join algorithm should do a join with two results ok 61 sort join algorithm should do a join with three conditions ok 62 sort join algorithm should return the two solutions through the searchStream interface ok 63 sort join algorithm should allow to find mutual friends ok 64 sort join algorithm should allow to intersect common friends ok 65 sort join algorithm should support the friend of a friend scenario ok 66 sort join algorithm should return triples from a join aka materialized API ok 67 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 68 sort join algorithm should emit triples from the stream interface aka materialized API ok 69 sort join algorithm should support filtering inside a condition ok 70 sort join algorithm should support filtering inside a second-level condition ok 71 sort join algorithm should support solution filtering ok 72 sort join algorithm should return only one solution with limit 1 ok 73 sort join algorithm should return only one solution with limit 1 (bis) ok 74 sort join algorithm should return skip the first solution with offset 1 ok 75 sort join algorithm should find homes in paris ok 76 sublevel support should put a triple ok 77 sublevel support should get a triple ok 78 sublevel support should put a triple with a stream ok 79 sublevel support should not close anything ok 80 a basic triple store should put a triple ok 81 a basic triple store should put an array of triples ok 82 a basic triple store should get only triples with exact match of subjects ok 83 a basic triple store should put a triple with an object to false ok 84 a basic triple store should put triples using a stream ok 85 a basic triple store should store the triples written using a stream ok 86 a basic triple store should del the triples using a stream ok 87 a basic triple store should support filtering ok 88 a basic triple store with a triple inserted should get it specifiying the subject ok 89 a basic triple store with a triple inserted should get it specifiying the object ok 90 a basic triple store with a triple inserted should get it specifiying the predicate ok 91 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 92 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 93 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 94 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 95 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 96 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 97 a basic triple store with a triple inserted should return the triple through the getStream interface ok 98 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 99 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 100 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 101 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 102 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 103 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 104 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 105 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 106 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 107 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 108 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 109 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 110 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 111 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 112 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 113 a basic triple store API deprecations should call searchStream when calling joinStream
1..133 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 a multileveled triple store should put a triple ok 21 a multileveled triple store should get a triple ok 22 a multileveled triple store should search a triple ok 23 a multileveled triple store should put a triple with a stream # SKIP - ok 24 a multileveled triple store should not close anything ok 25 navigator should navigate to a single vertex ok 26 navigator should follow an arch going out a vertex ok 27 navigator should follow an arch going in a vertex ok 28 navigator should follow multiple archs, in and out a path ok 29 navigator should follow multiple archs, in and out a path using a stream ok 30 navigator should allow to set the name of the variables ok 31 navigator should allow to bind a variable ok 32 navigator should allow to start the navigation from a variable ok 33 navigator should return the solutions ok 34 navigator should return the solution as a stream ok 35 navigator should return no solution if no condition is specified ok 36 navigator should return the materialized triples ok 37 navigator should return the materialized triples as a stream ok 38 navigator should go to another vertex ok 39 navigator should go to another vertex as a variable ok 40 navigator should alias solutions to contexts ok 41 navigator should alias solutionStream to contextStream ok 42 a basic triple store should put some more data inside a triple ok 43 a basic triple store should return the inserted data ok 44 query planner with basic algorithm should return a single condition as-is ok 45 query planner with basic algorithm should order two conditions based on their size ok 46 query planner with basic algorithm should order two conditions based on their size (bis) ok 47 query planner with basic algorithm should avoid variables ok 48 query planner with sort algorithm should return a single condition with the JoinStream ok 49 query planner with sort algorithm should put the second condition in the same order as the first ok 50 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 51 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 52 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 53 query planner with sort algorithm should put the variables from the previous condition in the same order ok 54 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 55 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 56 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 57 query planner without approximateSize should order two conditions based on their size ok 58 query planner without approximateSize should order two conditions based on their size (bis) ok 59 sort join algorithm should do a join with one results ok 60 sort join algorithm should do a join with two results ok 61 sort join algorithm should do a join with three conditions ok 62 sort join algorithm should return the two solutions through the searchStream interface ok 63 sort join algorithm should allow to find mutual friends ok 64 sort join algorithm should allow to intersect common friends ok 65 sort join algorithm should support the friend of a friend scenario ok 66 sort join algorithm should return triples from a join aka materialized API ok 67 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 68 sort join algorithm should emit triples from the stream interface aka materialized API ok 69 sort join algorithm should support filtering inside a condition ok 70 sort join algorithm should support filtering inside a second-level condition ok 71 sort join algorithm should support solution filtering ok 72 sort join algorithm should return only one solution with limit 1 ok 73 sort join algorithm should return only one solution with limit 1 (bis) ok 74 sort join algorithm should return skip the first solution with offset 1 ok 75 sort join algorithm should find homes in paris ok 76 sublevel support should put a triple ok 77 sublevel support should get a triple ok 78 sublevel support should put a triple with a stream ok 79 sublevel support should not close anything ok 80 a basic triple store should put a triple ok 81 a basic triple store should put an array of triples ok 82 a basic triple store should get only triples with exact match of subjects ok 83 a basic triple store should put a triple with an object to false ok 84 a basic triple store should put triples using a stream ok 85 a basic triple store should store the triples written using a stream ok 86 a basic triple store should del the triples using a stream ok 87 a basic triple store should support filtering ok 88 a basic triple store with a triple inserted should get it specifiying the subject ok 89 a basic triple store with a triple inserted should get it specifiying the object ok 90 a basic triple store with a triple inserted should get it specifiying the predicate ok 91 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 92 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 93 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 94 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 95 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 96 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 97 a basic triple store with a triple inserted should return the triple through the getStream interface ok 98 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 99 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 100 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 101 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 102 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 103 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 104 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 105 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 106 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 107 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 108 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 109 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 110 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 111 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 112 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 113 a basic triple store API deprecations should call searchStream when calling joinStream ok 114 a basic triple store API deprecations should alias search to join ok 115 a basic triple store API deprecations should warn when calling joinStream ok 116 a basic triple store API deprecations should warn when calling join ok 117 deferred open support should call the callback if a level is passed ok 118 deferred open support should call the callback if a level is not passed ok 119 deferred open support should call the callback with a levelgrap ok 120 deferred open support should support deferred search ok 121 generateBatch should generate a batch from a triple ok 122 generateBatch should generate a batch of type ok 123 Variable should have a name ok 124 Variable should have a name (bis) ok 125 Variable isBound should return true if there is a key in the solution ok 126 Variable isBound should return false if there is no key in the solution ok 127 Variable isBound should return false if there is another key in the solution ok 128 Variable bind should return a different object ok 129 Variable bind should set an element in the solution ok 130 Variable bind should copy values ok 131 Variable isBindable should bind to the same value ok 132 Variable isBindable should not bind to a different value ok 133 Variable isBindable should bind if the key is not present # tests 132 # pass 132 # fail 0
not ok 1 Error: Syntax error on line 17426
2014-01-20 11:51:56
10.0
29.0
24.0
15.0
1..133 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 a multileveled triple store should put a triple ok 21 a multileveled triple store should get a triple ok 22 a multileveled triple store should search a triple ok 23 a multileveled triple store should put a triple with a stream not ok 24 a multileveled triple store should not close anything Error: Uncaught Error: stream is not writable: 3c66c169b2059d27 (http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/1390217681894.28fb7aaa.js:25144) at global.onerror (http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:5622:10) ok 25 navigator should navigate to a single vertex ok 26 navigator should follow an arch going out a vertex ok 27 navigator should follow an arch going in a vertex ok 28 navigator should follow multiple archs, in and out a path ok 29 navigator should follow multiple archs, in and out a path using a stream ok 30 navigator should allow to set the name of the variables ok 31 navigator should allow to bind a variable ok 32 navigator should allow to start the navigation from a variable ok 33 navigator should return the solutions ok 34 navigator should return the solution as a stream ok 35 navigator should return no solution if no condition is specified ok 36 navigator should return the materialized triples ok 37 navigator should return the materialized triples as a stream ok 38 navigator should go to another vertex ok 39 navigator should go to another vertex as a variable ok 40 navigator should alias solutions to contexts ok 41 navigator should alias solutionStream to contextStream ok 42 a basic triple store should put some more data inside a triple ok 43 a basic triple store should return the inserted data ok 44 query planner with basic algorithm should return a single condition as-is ok 45 query planner with basic algorithm should order two conditions based on their size ok 46 query planner with basic algorithm should order two conditions based on their size (bis) ok 47 query planner with basic algorithm should avoid variables ok 48 query planner with sort algorithm should return a single condition with the JoinStream ok 49 query planner with sort algorithm should put the second condition in the same order as the first ok 50 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 51 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 52 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 53 query planner with sort algorithm should put the variables from the previous condition in the same order ok 54 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 55 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 56 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 57 query planner without approximateSize should order two conditions based on their size ok 58 query planner without approximateSize should order two conditions based on their size (bis) ok 59 sort join algorithm should do a join with one results ok 60 sort join algorithm should do a join with two results ok 61 sort join algorithm should do a join with three conditions ok 62 sort join algorithm should return the two solutions through the searchStream interface ok 63 sort join algorithm should allow to find mutual friends ok 64 sort join algorithm should allow to intersect common friends ok 65 sort join algorithm should support the friend of a friend scenario ok 66 sort join algorithm should return triples from a join aka materialized API ok 67 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 68 sort join algorithm should emit triples from the stream interface aka materialized API ok 69 sort join algorithm should support filtering inside a condition ok 70 sort join algorithm should support filtering inside a second-level condition ok 71 sort join algorithm should support solution filtering ok 72 sort join algorithm should return only one solution with limit 1 ok 73 sort join algorithm should return only one solution with limit 1 (bis) ok 74 sort join algorithm should return skip the first solution with offset 1 ok 75 sort join algorithm should find homes in paris ok 76 sublevel support should put a triple ok 77 sublevel support should get a triple ok 78 sublevel support should put a triple with a stream ok 79 sublevel support should not close anything ok 80 a basic triple store should put a triple ok 81 a basic triple store should put an array of triples ok 82 a basic triple store should get only triples with exact match of subjects ok 83 a basic triple store should put a triple with an object to false ok 84 a basic triple store should put triples using a stream ok 85 a basic triple store should store the triples written using a stream ok 86 a basic triple store should del the triples using a stream ok 87 a basic triple store should support filtering ok 88 a basic triple store with a triple inserted should get it specifiying the subject ok 89 a basic triple store with a triple inserted should get it specifiying the object ok 90 a basic triple store with a triple inserted should get it specifiying the predicate ok 91 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 92 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 93 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 94 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 95 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 96 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 97 a basic triple store with a triple inserted should return the triple through the getStream interface ok 98 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 99 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 100 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 101 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 102 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 103 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 104 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 105 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 106 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 107 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 108 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 109 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 110 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 111 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2
1..133 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 a multileveled triple store should put a triple ok 21 a multileveled triple store should get a triple ok 22 a multileveled triple store should search a triple ok 23 a multileveled triple store should put a triple with a stream not ok 24 a multileveled triple store should not close anything Error: Uncaught Error: stream is not writable: c681feab2e0484dc (http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/1390217681894.28fb7aaa.js:25144) at global.onerror (http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:5622:10) ok 25 navigator should navigate to a single vertex ok 26 a basic triple store should put some more data inside a triple ok 27 a basic triple store should return the inserted data not ok 28 navigator should follow an arch going out a vertex Error: Uncaught AssertionError: expected [] to deeply equal [ 'daniele' ] (http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/1390217681894.28fb7aaa.js:7328) at global.onerror (http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:5622:10) ok 29 query planner with basic algorithm should return a single condition as-is ok 30 query planner with basic algorithm should order two conditions based on their size ok 31 query planner with basic algorithm should order two conditions based on their size (bis) ok 32 query planner with basic algorithm should order two conditions based on their size (bis) not ok 33 a basic triple store should put some more data inside a triple Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 33 a basic triple store should put some more data inside a triple Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 33 navigator should follow an arch going in a vertex Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 34 sort join algorithm should do a join with one results Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 ok 35 query planner with sort algorithm should return a single condition with the JoinStream ok 36 query planner with sort algorithm should put the second condition in the same order as the first ok 37 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 38 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 39 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 40 query planner with sort algorithm should put the variables from the previous condition in the same order ok 41 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 42 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 43 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 44 query planner without approximateSize should order two conditions based on their size ok 45 query planner without approximateSize should order two conditions based on their size (bis) ok 46 sublevel support should put a triple ok 47 sort join algorithm should do a join with two results ok 48 sublevel support should get a triple ok 49 sublevel support should put a triple with a stream ok 50 sublevel support should not close anything ok 51 a basic triple store should put a triple ok 52 a basic triple store should put an array of triples ok 53 a basic triple store should get only triples with exact match of subjects ok 54 a basic triple store should put a triple with an object to false ok 55 a basic triple store should put triples using a stream ok 56 a basic triple store should store the triples written using a stream ok 57 a basic triple store should del the triples using a stream ok 58 a basic triple store should support filtering ok 59 a basic triple store with a triple inserted should get it specifiying the subject ok 60 a basic triple store with a triple inserted should get it specifiying the object ok 61 a basic triple store with a triple inserted should get it specifiying the predicate ok 62 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 63 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 64 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 65 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 66 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 67 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 68 a basic triple store with a triple inserted should return the triple through the getStream interface ok 69 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 70 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 71 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 72 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 73 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 74 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 75 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 76 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 77 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 78 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 79 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 80 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 81 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 82 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 83 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 84 a basic triple store API deprecations should call searchStream when calling joinStream ok 85 a basic triple store API deprecations should alias search to join ok 86 a basic triple store API deprecations should warn when calling joinStream ok 87 a basic triple store API deprecations should warn when calling join ok 88 deferred open support should call the callback if a level is passed ok 89 deferred open support should call the callback if a level is not passed ok 90 deferred open support should call the callback with a levelgrap ok 91 deferred open support should support deferred search ok 92 generateBatch should generate a batch from a triple ok 93 generateBatch should generate a batch of type ok 94 Variable should have a name ok 95 Variable should have a name (bis) ok 96 Variable isBound should return true if there is a key in the solution ok 97 Variable isBound should return false if there is no key in the solution ok 98 Variable isBound should return false if there is another key in the solution ok 99 Variable bind should return a different object ok 100 Variable bind should set an element in the solution ok 101 Variable bind should copy values ok 102 Variable isBindable should bind to the same value ok 103 Variable isBindable should not bind to a different value ok 104 Variable isBindable should bind if the key is not present # tests 106 # pass 100 # fail 6 not ok 105 Variable isBindable should bind if the key is not present Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 106 sort join algorithm should do a join with three conditions Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 107 sort join algorithm should return the two solutions through the searchStream interface Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 108 sort join algorithm should allow to find mutual friends Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 109 sort join algorithm should allow to intersect common friends Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 110 sort join algorithm should support the friend of a friend scenario Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 111 sort join algorithm should return triples from a join aka materialized API Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 112 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 113 sort join algorithm should emit triples from the stream interface aka materialized API Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 114 sort join algorithm should support filtering inside a condition Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 115 sort join algorithm should support filtering inside a second-level condition Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 116 sort join algorithm should support solution filtering Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 117 sort join algorithm should return only one solution with limit 1 Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 118 sort join algorithm should return only one solution with limit 1 (bis) Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 119 sort join algorithm should return skip the first solution with offset 1 Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 not ok 120 sort join algorithm should find homes in paris Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241:14 # tests 122 # pass 100 # fail 22
1..133 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 a multileveled triple store should put a triple ok 21 a multileveled triple store should get a triple ok 22 a multileveled triple store should search a triple ok 23 a multileveled triple store should put a triple with a stream not ok 24 a multileveled triple store should not close anything process.on/global.onerror@http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:5622 ok 25 navigator should navigate to a single vertex ok 26 a basic triple store should put some more data inside a triple ok 27 a basic triple store should return the inserted data ok 28 navigator should follow an arch going out a vertex ok 29 navigator should follow an arch going out a vertex ok 30 query planner with basic algorithm should return a single condition as-is ok 31 query planner with basic algorithm should order two conditions based on their size ok 32 query planner with basic algorithm should order two conditions based on their size (bis) ok 33 query planner with basic algorithm should avoid variables ok 34 query planner with sort algorithm should return a single condition with the JoinStream ok 35 query planner with sort algorithm should put the second condition in the same order as the first ok 36 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 37 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 38 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 39 navigator should follow multiple archs, in and out a path ok 40 navigator should follow multiple archs, in and out a path ok 41 navigator should follow multiple archs, in and out a path using a stream ok 42 navigator should follow multiple archs, in and out a path using a stream ok 43 navigator should allow to set the name of the variables ok 44 navigator should allow to set the name of the variables ok 45 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario not ok 46 a basic triple store should put some more data inside a triple @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 a basic triple store should put some more data inside a triple @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 navigator should follow an arch going out a vertex @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 navigator should follow an arch going out a vertex @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 navigator should follow multiple archs, in and out a path @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 navigator should follow multiple archs, in and out a path @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 navigator should follow multiple archs, in and out a path using a stream @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 navigator should follow multiple archs, in and out a path using a stream @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 navigator should allow to set the name of the variables @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 navigator should allow to set the name of the variables @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 not ok 46 navigator "after each" hook @http://git.testling.com/work/mcollina/repos/66d561499c1b93ff8ba9710acb3a65b9b3ad3229.1390217681559/node_modules/mocha/mocha.js:4241 ok 46 sort join algorithm should do a join with one results ok 47 sort join algorithm should do a join with two results ok 48 sort join algorithm should do a join with three conditions ok 49 sort join algorithm should return the two solutions through the searchStream interface ok 50 sort join algorithm should allow to find mutual friends ok 51 sort join algorithm should allow to intersect common friends ok 52 sort join algorithm should support the friend of a friend scenario ok 53 sort join algorithm should return triples from a join aka materialized API ok 54 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 55 sort join algorithm should emit triples from the stream interface aka materialized API ok 56 sort join algorithm should support filtering inside a condition ok 57 sort join algorithm should support filtering inside a second-level condition ok 58 sort join algorithm should support solution filtering ok 59 sort join algorithm should return only one solution with limit 1 ok 60 sort join algorithm should return only one solution with limit 1 (bis) ok 61 sort join algorithm should return skip the first solution with offset 1 ok 62 sort join algorithm should find homes in paris ok 63 sublevel support should put a triple ok 64 sublevel support should get a triple ok 65 sublevel support should put a triple with a stream ok 66 sublevel support should not close anything ok 67 a basic triple store should put a triple ok 68 a basic triple store should put an array of triples ok 69 a basic triple store should get only triples with exact match of subjects ok 70 a basic triple store should put a triple with an object to false ok 71 a basic triple store should put triples using a stream ok 72 a basic triple store should store the triples written using a stream ok 73 a basic triple store should del the triples using a stream ok 74 a basic triple store should support filtering ok 75 a basic triple store with a triple inserted should get it specifiying the subject ok 76 a basic triple store with a triple inserted should get it specifiying the object ok 77 a basic triple store with a triple inserted should get it specifiying the predicate ok 78 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 79 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 80 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 81 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 82 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 83 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 84 a basic triple store with a triple inserted should return the triple through the getStream interface ok 85 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 86 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 87 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 88 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 89 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 90 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 91 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 92 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 93 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 94 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 95 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 96 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 97 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 98 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 99 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 100 a basic triple store API deprecations should call searchStream when calling joinStream ok 101 a basic triple store API deprecations should alias search to join ok 102 a basic triple store API deprecations should warn when calling joinStream ok 103 a basic triple store API deprecations should warn when calling join ok 104 deferred open support should call the callback if a level is passed ok 105 deferred open support should call the callback if a level is not passed ok 106 deferred open support should call the callback with a levelgrap ok 107 deferred open support should support deferred search ok 108 generateBatch should generate a batch from a triple ok 109 generateBatch should generate a batch of type ok 110 Variable should have a name ok 111 Variable should have a name (bis) ok 112 Variable isBound should return true if there is a key in the solution ok 113 Variable isBound should return false if there is no key in the solution ok 114 Variable isBound should return false if there is another key in the solution ok 115 Variable bind should return a different object ok 116 Variable bind should set an element in the solution ok 117 Variable bind should copy values ok 118 Variable isBindable should bind to the same value ok 119 Variable isBindable should not bind to a different value ok 120 Variable isBindable should bind if the key is not present # tests 133 # pass 119 # fail 14
not ok 1 Error: Syntax error on line 17426
2014-01-19 21:29:56
10.0
✓29.0
✓24.0
15.0
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface not ok 93 a basic triple store "before each" hook Error: Uncaught [object Object] (http://git.testling.com/work/mcollina/repos/96876ab164864ed2cc0d87a5dfca5838413729dc.1390166138588/1390166139099.0901999.js:3131) at global.onerror (http://git.testling.com/work/mcollina/repos/96876ab164864ed2cc0d87a5dfca5838413729dc.1390166138588/node_modules/mocha/mocha.js:5622:10) # tests 93 # pass 92 # fail 1 not ok 93 a basic triple store with a triple inserted "before each" hook Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/96876ab164864ed2cc0d87a5dfca5838413729dc.1390166138588/node_modules/mocha/mocha.js:4241:14 not ok 93 a basic triple store "after each" hook Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/96876ab164864ed2cc0d87a5dfca5838413729dc.1390166138588/node_modules/mocha/mocha.js:4241:14 ok 93 deferred open support should call the callback if a level is passed ok 94 deferred open support should call the callback if a level is not passed ok 95 deferred open support should call the callback with a levelgrap ok 96 deferred open support should support deferred search ok 97 generateBatch should generate a batch from a triple ok 98 generateBatch should generate a batch of type ok 99 Variable should have a name ok 100 Variable should have a name (bis) ok 101 Variable isBound should return true if there is a key in the solution ok 102 Variable isBound should return false if there is no key in the solution ok 103 Variable isBound should return false if there is another key in the solution ok 104 Variable bind should return a different object ok 105 Variable bind should set an element in the solution ok 106 Variable bind should copy values ok 107 Variable isBindable should bind to the same value ok 108 Variable isBindable should not bind to a different value ok 109 Variable isBindable should bind if the key is not present # tests 112 # pass 109 # fail 3
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query not ok 92 a basic triple store with a triple inserted "before each" hook Error: Uncaught [object Object] (http://git.testling.com/work/mcollina/repos/96876ab164864ed2cc0d87a5dfca5838413729dc.1390166138588/1390166139099.0901999.js:3131) at global.onerror (http://git.testling.com/work/mcollina/repos/96876ab164864ed2cc0d87a5dfca5838413729dc.1390166138588/node_modules/mocha/mocha.js:5622:10) # tests 92 # pass 91 # fail 1
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 generateBatch should generate a batch from a triple ok 117 generateBatch should generate a batch of type ok 118 Variable should have a name ok 119 Variable should have a name (bis) ok 120 Variable isBound should return true if there is a key in the solution ok 121 Variable isBound should return false if there is no key in the solution ok 122 Variable isBound should return false if there is another key in the solution ok 123 Variable bind should return a different object ok 124 Variable bind should set an element in the solution ok 125 Variable bind should copy values ok 126 Variable isBindable should bind to the same value ok 127 Variable isBindable should not bind to a different value ok 128 Variable isBindable should bind if the key is not present # tests 128 # pass 128 # fail 0
not ok 1 Error: Syntax error on line 17232
2014-01-19 16:12:25
10.0
✓29.0
24.0
15.0
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join
1..128 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 generateBatch should generate a batch from a triple ok 117 generateBatch should generate a batch of type ok 118 Variable should have a name ok 119 Variable should have a name (bis) ok 120 Variable isBound should return true if there is a key in the solution ok 121 Variable isBound should return false if there is no key in the solution ok 122 Variable isBound should return false if there is another key in the solution ok 123 Variable bind should return a different object ok 124 Variable bind should set an element in the solution ok 125 Variable bind should copy values ok 126 Variable isBindable should bind to the same value ok 127 Variable isBindable should not bind to a different value ok 128 Variable isBindable should bind if the key is not present # tests 128 # pass 128 # fail 0
not ok 1 Error: Syntax error on line 17232
2014-01-19 10:57:36
10.0
✓29.0
24.0
15.0
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 Variable should have a name ok 117 Variable should have a name (bis) ok 118 Variable isBound should return true if there is a key in the solution ok 119 Variable isBound should return false if there is no key in the solution ok 120 Variable isBound should return false if there is another key in the solution ok 121 Variable bind should return a different object ok 122 Variable bind should set an element in the solution ok 123 Variable bind should copy values ok 124 Variable isBindable should bind to the same value ok 125 Variable isBindable should not bind to a different value ok 126 Variable isBindable should bind if the key is not present # tests 126 # pass 126 # fail 0
not ok 1 Error: Syntax error on line 17228
2014-01-18 12:33:14
10.0
✓29.0
24.0
15.0
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 Variable should have a name ok 117 Variable should have a name (bis) ok 118 Variable isBound should return true if there is a key in the solution ok 119 Variable isBound should return false if there is no key in the solution ok 120 Variable isBound should return false if there is another key in the solution ok 121 Variable bind should return a different object ok 122 Variable bind should set an element in the solution ok 123 Variable bind should copy values ok 124 Variable isBindable should bind to the same value ok 125 Variable isBindable should not bind to a different value ok 126 Variable isBindable should bind if the key is not present # tests 126 # pass 126 # fail 0
not ok 1 Error: Syntax error on line 17227
2014-01-18 11:56:39
10.0
✓29.0
✓24.0
15.0
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 Variable should have a name ok 117 Variable should have a name (bis) ok 118 Variable isBound should return true if there is a key in the solution ok 119 Variable isBound should return false if there is no key in the solution ok 120 Variable isBound should return false if there is another key in the solution ok 121 Variable bind should return a different object ok 122 Variable bind should set an element in the solution ok 123 Variable bind should copy values ok 124 Variable isBindable should bind to the same value ok 125 Variable isBindable should not bind to a different value ok 126 Variable isBindable should bind if the key is not present # tests 126 # pass 126 # fail 0
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 Variable should have a name ok 117 Variable should have a name (bis) ok 118 Variable isBound should return true if there is a key in the solution ok 119 Variable isBound should return false if there is no key in the solution ok 120 Variable isBound should return false if there is another key in the solution ok 121 Variable bind should return a different object ok 122 Variable bind should set an element in the solution ok 123 Variable bind should copy values ok 124 Variable isBindable should bind to the same value ok 125 Variable isBindable should not bind to a different value ok 126 Variable isBindable should bind if the key is not present # tests 126 # pass 126 # fail 0
not ok 1 Error: Syntax error on line 17227
2014-01-17 12:55:45
10.0
29.0
24.0
15.0
1..130 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 a multileveled triple store should put a triple ok 21 a multileveled triple store should get a triple ok 22 a multileveled triple store should search a triple ok 23 a multileveled triple store should put a triple with a stream not ok 24 a multileveled triple store should not close anything Error: Uncaught Error: stream is not writable: 58e1fd719ca6face (http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/1389962177443.d1504bc5.js:25078) at global.onerror (http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:5622:10) ok 25 navigator should navigate to a single vertex ok 26 navigator should follow an arch going out a vertex ok 27 navigator should follow an arch going in a vertex ok 28 navigator should follow multiple archs, in and out a path ok 29 navigator should follow multiple archs, in and out a path using a stream ok 30 navigator should allow to set the name of the variables ok 31 navigator should allow to bind a variable ok 32 navigator should allow to start the navigation from a variable ok 33 navigator should return the solutions ok 34 navigator should return the solution as a stream ok 35 navigator should return no solution if no condition is specified ok 36 navigator should return the materialized triples ok 37 navigator should return the materialized triples as a stream ok 38 navigator should go to another vertex ok 39 navigator should go to another vertex as a variable ok 40 navigator should alias solutions to contexts ok 41 navigator should alias solutionStream to contextStream ok 42 a basic triple store should put some more data inside a triple ok 43 a basic triple store should return the inserted data ok 44 query planner with basic algorithm should return a single condition as-is ok 45 query planner with basic algorithm should order two conditions based on their size ok 46 query planner with basic algorithm should order two conditions based on their size (bis) ok 47 query planner with basic algorithm should avoid variables ok 48 query planner with sort algorithm should return a single condition with the JoinStream ok 49 query planner with sort algorithm should put the second condition in the same order as the first ok 50 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 51 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 52 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 53 query planner with sort algorithm should put the variables from the previous condition in the same order ok 54 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 55 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 56 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 57 query planner without approximateSize should order two conditions based on their size ok 58 query planner without approximateSize should order two conditions based on their size (bis) ok 59 sort join algorithm should do a join with one results ok 60 sort join algorithm should do a join with two results ok 61 sort join algorithm should do a join with three conditions ok 62 sort join algorithm should return the two solutions through the searchStream interface ok 63 sort join algorithm should allow to find mutual friends ok 64 sort join algorithm should allow to intersect common friends ok 65 sort join algorithm should support the friend of a friend scenario ok 66 sort join algorithm should return triples from a join aka materialized API ok 67 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 68 sort join algorithm should emit triples from the stream interface aka materialized API ok 69 sort join algorithm should support filtering inside a condition ok 70 sort join algorithm should support filtering inside a second-level condition ok 71 sort join algorithm should support solution filtering ok 72 sort join algorithm should return only one solution with limit 1 ok 73 sort join algorithm should return only one solution with limit 1 (bis) ok 74 sort join algorithm should return skip the first solution with offset 1 ok 75 sort join algorithm should find homes in paris ok 76 sublevel support should put a triple ok 77 sublevel support should get a triple ok 78 sublevel support should put a triple with a stream ok 79 sublevel support should not close anything ok 80 a basic triple store should put a triple ok 81 a basic triple store should put an array of triples ok 82 a basic triple store should get only triples with exact match of subjects ok 83 a basic triple store should put a triple with an object to false ok 84 a basic triple store should put triples using a stream ok 85 a basic triple store should store the triples written using a stream ok 86 a basic triple store should del the triples using a stream ok 87 a basic triple store should support filtering ok 88 a basic triple store with a triple inserted should get it specifiying the subject ok 89 a basic triple store with a triple inserted should get it specifiying the object ok 90 a basic triple store with a triple inserted should get it specifiying the predicate ok 91 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 92 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 93 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 94 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 95 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 96 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 97 a basic triple store with a triple inserted should return the triple through the getStream interface ok 98 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 99 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 100 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 101 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 102 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 103 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 104 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 105 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 106 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 107 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 108 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 109 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 110 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 111 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 112 a basic triple store with two triple inserted with the same predicate should support offset over streams
1..130 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 a multileveled triple store should put a triple ok 21 a multileveled triple store should get a triple ok 22 a multileveled triple store should search a triple ok 23 a multileveled triple store should put a triple with a stream not ok 24 a multileveled triple store should not close anything Error: Uncaught Error: stream is not writable: 4088ce5f4a50dd1e (http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/1389962177443.d1504bc5.js:25078) at global.onerror (http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:5622:10) ok 25 navigator should navigate to a single vertex ok 26 a basic triple store should put some more data inside a triple ok 27 a basic triple store should return the inserted data not ok 28 navigator should follow an arch going out a vertex Error: Uncaught Error: Not implemented (http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/1389962177443.d1504bc5.js:11520) at global.onerror (http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:5622:10) not ok 29 a basic triple store should put some more data inside a triple Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 29 a basic triple store should put some more data inside a triple Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 29 navigator "after each" hook Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 29 navigator should follow an arch going out a vertex Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 # tests 32 # pass 26 # fail 6 not ok 30 navigator should follow an arch going in a vertex Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 31 navigator should follow multiple archs, in and out a path Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 32 navigator should follow multiple archs, in and out a path using a stream Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 33 navigator should allow to set the name of the variables Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 34 navigator should allow to bind a variable Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 35 navigator should allow to start the navigation from a variable Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 36 navigator should return the solutions Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 37 navigator should return the solution as a stream Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 ok 38 navigator should return no solution if no condition is specified not ok 39 navigator should return the materialized triples Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 40 navigator should return the materialized triples as a stream Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 41 navigator should go to another vertex Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 not ok 42 navigator should go to another vertex as a variable Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241:14 ok 43 navigator should alias solutions to contexts ok 44 navigator should alias solutionStream to contextStream ok 45 query planner with basic algorithm should return a single condition as-is ok 46 query planner with basic algorithm should order two conditions based on their size ok 47 query planner with basic algorithm should order two conditions based on their size (bis) ok 48 query planner with basic algorithm should avoid variables ok 49 query planner with sort algorithm should return a single condition with the JoinStream ok 50 query planner with sort algorithm should put the second condition in the same order as the first ok 51 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 52 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 53 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 54 query planner with sort algorithm should put the variables from the previous condition in the same order ok 55 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 56 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 57 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 58 query planner without approximateSize should order two conditions based on their size ok 59 query planner without approximateSize should order two conditions based on their size (bis) ok 60 sort join algorithm should do a join with one results ok 61 sort join algorithm should do a join with two results ok 62 sort join algorithm should do a join with three conditions ok 63 sort join algorithm should return the two solutions through the searchStream interface ok 64 sort join algorithm should allow to find mutual friends ok 65 sort join algorithm should allow to intersect common friends ok 66 sort join algorithm should support the friend of a friend scenario ok 67 sort join algorithm should return triples from a join aka materialized API ok 68 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 69 sort join algorithm should emit triples from the stream interface aka materialized API ok 70 sort join algorithm should support filtering inside a condition ok 71 sort join algorithm should support filtering inside a second-level condition ok 72 sort join algorithm should support solution filtering ok 73 sort join algorithm should return only one solution with limit 1 ok 74 sort join algorithm should return only one solution with limit 1 (bis) ok 75 sort join algorithm should return skip the first solution with offset 1 ok 76 sort join algorithm should find homes in paris ok 77 sublevel support should put a triple ok 78 sublevel support should get a triple ok 79 sublevel support should put a triple with a stream ok 80 sublevel support should not close anything ok 81 a basic triple store should put a triple ok 82 a basic triple store should put an array of triples ok 83 a basic triple store should get only triples with exact match of subjects ok 84 a basic triple store should put a triple with an object to false ok 85 a basic triple store should put triples using a stream ok 86 a basic triple store should store the triples written using a stream ok 87 a basic triple store should del the triples using a stream ok 88 a basic triple store should support filtering ok 89 a basic triple store with a triple inserted should get it specifiying the subject ok 90 a basic triple store with a triple inserted should get it specifiying the object ok 91 a basic triple store with a triple inserted should get it specifiying the predicate ok 92 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 93 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 94 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 95 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 96 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 97 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 98 a basic triple store with a triple inserted should return the triple through the getStream interface ok 99 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 100 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 101 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 102 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 103 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 104 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 105 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 106 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 107 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 108 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 109 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 110 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 111 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 112 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 113 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 114 a basic triple store API deprecations should call searchStream when calling joinStream ok 115 a basic triple store API deprecations should alias search to join ok 116 a basic triple store API deprecations should warn when calling joinStream ok 117 a basic triple store API deprecations should warn when calling join ok 118 deferred open support should call the callback if a level is passed ok 119 deferred open support should call the callback if a level is not passed ok 120 deferred open support should call the callback with a levelgrap ok 121 Variable should have a name ok 122 Variable should have a name (bis) ok 123 Variable isBound should return true if there is a key in the solution ok 124 Variable isBound should return false if there is no key in the solution ok 125 Variable isBound should return false if there is another key in the solution ok 126 Variable bind should return a different object ok 127 Variable bind should set an element in the solution ok 128 Variable bind should copy values ok 129 Variable isBindable should bind to the same value ok 130 Variable isBindable should not bind to a different value ok 131 Variable isBindable should bind if the key is not present # tests 134 # pass 116 # fail 18
1..130 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 a multileveled triple store should put a triple ok 21 a multileveled triple store should get a triple ok 22 a multileveled triple store should search a triple ok 23 a multileveled triple store should put a triple with a stream not ok 24 a multileveled triple store should not close anything process.on/global.onerror@http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:5622 ok 25 navigator should navigate to a single vertex ok 26 navigator should navigate to a single vertex ok 27 navigator should follow an arch going out a vertex ok 28 a basic triple store should return the inserted data ok 29 a basic triple store should return the inserted data ok 30 query planner with basic algorithm should return a single condition as-is ok 31 query planner with basic algorithm should order two conditions based on their size ok 32 query planner with basic algorithm should order two conditions based on their size (bis) ok 33 query planner with basic algorithm should avoid variables ok 34 query planner with sort algorithm should return a single condition with the JoinStream ok 35 query planner with sort algorithm should put the second condition in the same order as the first ok 36 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 37 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 38 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 39 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 40 query planner with sort algorithm should put the variables from the previous condition in the same order ok 41 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 42 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 43 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario not ok 44 navigator should follow multiple archs, in and out a path using a stream process.on/global.onerror@http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:5622 not ok 45 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 45 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 45 navigator "after each" hook @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 # tests 47 # pass 42 # fail 5 not ok 45 navigator should follow multiple archs, in and out a path using a stream @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 46 navigator should allow to set the name of the variables @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 47 navigator should allow to bind a variable @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 48 navigator should allow to start the navigation from a variable @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 49 navigator should return the solutions @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 50 navigator should return the solution as a stream @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 ok 51 navigator should return no solution if no condition is specified not ok 52 navigator should return the materialized triples @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 53 navigator should return the materialized triples as a stream @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 54 navigator should go to another vertex @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 not ok 55 navigator should go to another vertex as a variable @http://git.testling.com/work/mcollina/repos/584755272e764e061a34fb15b3d00f550777f51c.1389962175909/node_modules/mocha/mocha.js:4241 ok 56 navigator should alias solutions to contexts ok 57 navigator should alias solutionStream to contextStream ok 58 sort join algorithm should do a join with one results ok 59 sort join algorithm should do a join with two results ok 60 sort join algorithm should do a join with three conditions ok 61 sort join algorithm should return the two solutions through the searchStream interface ok 62 sort join algorithm should allow to find mutual friends ok 63 sort join algorithm should allow to intersect common friends ok 64 sort join algorithm should support the friend of a friend scenario ok 65 sort join algorithm should return triples from a join aka materialized API ok 66 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 67 sort join algorithm should emit triples from the stream interface aka materialized API ok 68 sort join algorithm should support filtering inside a condition ok 69 sort join algorithm should support filtering inside a second-level condition ok 70 sort join algorithm should support solution filtering ok 71 sort join algorithm should return only one solution with limit 1 ok 72 sort join algorithm should return only one solution with limit 1 (bis) ok 73 sort join algorithm should return skip the first solution with offset 1 ok 74 sort join algorithm should find homes in paris ok 75 sublevel support should put a triple ok 76 sublevel support should get a triple ok 77 sublevel support should put a triple with a stream ok 78 sublevel support should not close anything ok 79 a basic triple store should put a triple ok 80 a basic triple store should put an array of triples ok 81 a basic triple store should get only triples with exact match of subjects ok 82 a basic triple store should put a triple with an object to false ok 83 a basic triple store should put triples using a stream ok 84 a basic triple store should store the triples written using a stream ok 85 a basic triple store should del the triples using a stream ok 86 a basic triple store should support filtering ok 87 a basic triple store with a triple inserted should get it specifiying the subject ok 88 a basic triple store with a triple inserted should get it specifiying the object ok 89 a basic triple store with a triple inserted should get it specifiying the predicate ok 90 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 91 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 92 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 93 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 94 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 95 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 96 a basic triple store with a triple inserted should return the triple through the getStream interface ok 97 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 98 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 99 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 100 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 101 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 102 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 103 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 104 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 106 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 107 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 108 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 109 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 110 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 111 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 112 a basic triple store API deprecations should call searchStream when calling joinStream ok 113 a basic triple store API deprecations should alias search to join ok 114 a basic triple store API deprecations should warn when calling joinStream ok 115 a basic triple store API deprecations should warn when calling join ok 116 deferred open support should call the callback if a level is passed ok 117 deferred open support should call the callback if a level is not passed ok 118 deferred open support should call the callback with a levelgrap ok 119 Variable should have a name ok 120 Variable should have a name (bis) ok 121 Variable isBound should return true if there is a key in the solution ok 122 Variable isBound should return false if there is no key in the solution ok 123 Variable isBound should return false if there is another key in the solution ok 124 Variable bind should return a different object ok 125 Variable bind should set an element in the solution ok 126 Variable bind should copy values ok 127 Variable isBindable should bind to the same value ok 128 Variable isBindable should not bind to a different value ok 129 Variable isBindable should bind if the key is not present # tests 132 # pass 117 # fail 15
not ok 1 Error: Syntax error on line 17360
2014-01-17 12:12:49
10.0
✓29.0
✓24.0
15.0
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 Variable should have a name ok 117 Variable should have a name (bis) ok 118 Variable isBound should return true if there is a key in the solution ok 119 Variable isBound should return false if there is no key in the solution ok 120 Variable isBound should return false if there is another key in the solution ok 121 Variable bind should return a different object ok 122 Variable bind should set an element in the solution ok 123 Variable bind should copy values ok 124 Variable isBindable should bind to the same value ok 125 Variable isBindable should not bind to a different value ok 126 Variable isBindable should bind if the key is not present # tests 126 # pass 126 # fail 0
1..126 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 deferred open support should support deferred search ok 116 Variable should have a name ok 117 Variable should have a name (bis) ok 118 Variable isBound should return true if there is a key in the solution ok 119 Variable isBound should return false if there is no key in the solution ok 120 Variable isBound should return false if there is another key in the solution ok 121 Variable bind should return a different object ok 122 Variable bind should set an element in the solution ok 123 Variable bind should copy values ok 124 Variable isBindable should bind to the same value ok 125 Variable isBindable should not bind to a different value ok 126 Variable isBindable should bind if the key is not present # tests 126 # pass 126 # fail 0
not ok 1 Error: Syntax error on line 17227
2014-01-17 11:15:09
10.0
29.0
24.0
15.0
1..126 not ok 1 basic join algorithm should do a join with one results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 2 basic join algorithm should do a join with two results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 3 basic join algorithm should do a join with three conditions Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 4 basic join algorithm should return the two solutions through the searchStream interface Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 5 basic join algorithm should allow to find mutual friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 6 basic join algorithm should allow to intersect common friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 7 basic join algorithm should support the friend of a friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 8 basic join algorithm should return triples from a join aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 10 basic join algorithm should emit triples from the stream interface aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 11 basic join algorithm should support filtering inside a condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 12 basic join algorithm should support filtering inside a second-level condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 13 basic join algorithm should support solution filtering Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 14 basic join algorithm should return only one solution with limit 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 15 basic join algorithm should return only one solution with limit 1 (bis) Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 16 basic join algorithm should return skip the first solution with offset 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 17 basic join algorithm should find homes in paris Error: Uncaught Error: Not implemented (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503) at global.onerror (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/node_modules/mocha/mocha.js:5622:10) ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex not ok 21 navigator should follow an arch going out a vertex Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 22 navigator should follow an arch going in a vertex Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 23 navigator should follow multiple archs, in and out a path Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 24 navigator should follow multiple archs, in and out a path using a stream Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 25 navigator should allow to set the name of the variables Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 26 navigator should allow to bind a variable Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 27 navigator should allow to start the navigation from a variable Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 28 navigator should return the solutions Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 29 navigator should return the solution as a stream Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) ok 30 navigator should return no solution if no condition is specified not ok 31 navigator should return the materialized triples Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 32 navigator should return the materialized triples as a stream Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 33 navigator should go to another vertex Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 34 navigator should go to another vertex as a variable Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) not ok 54 sort join algorithm should do a join with one results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 55 sort join algorithm should do a join with two results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 56 sort join algorithm should do a join with three conditions Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 57 sort join algorithm should return the two solutions through the searchStream interface Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 58 sort join algorithm should allow to find mutual friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 59 sort join algorithm should allow to intersect common friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 60 sort join algorithm should support the friend of a friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 61 sort join algorithm should return triples from a join aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 63 sort join algorithm should emit triples from the stream interface aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 64 sort join algorithm should support filtering inside a condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 65 sort join algorithm should support filtering inside a second-level condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 66 sort join algorithm should support solution filtering Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 67 sort join algorithm should return only one solution with limit 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 68 sort join algorithm should return only one solution with limit 1 (bis) Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 69 sort join algorithm should return skip the first solution with offset 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at async.each.result.forEach.q.stream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 70 sort join algorithm should find homes in paris Error: Uncaught Error: Not implemented (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503) at global.onerror (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/node_modules/mocha/mocha.js:5622:10) ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream
1..126 not ok 1 basic join algorithm should do a join with one results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 2 basic join algorithm should do a join with two results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 3 basic join algorithm should do a join with three conditions Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 4 basic join algorithm should return the two solutions through the searchStream interface Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 5 basic join algorithm should allow to find mutual friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 6 basic join algorithm should allow to intersect common friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 7 basic join algorithm should support the friend of a friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 8 basic join algorithm should return triples from a join aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 10 basic join algorithm should emit triples from the stream interface aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 11 basic join algorithm should support filtering inside a condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 12 basic join algorithm should support filtering inside a second-level condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 13 basic join algorithm should support solution filtering Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 14 basic join algorithm should return only one solution with limit 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 15 basic join algorithm should return only one solution with limit 1 (bis) Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 16 basic join algorithm should return skip the first solution with offset 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 17 basic join algorithm should find homes in paris Error: Uncaught Error: Not implemented (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503) at global.onerror (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/node_modules/mocha/mocha.js:5622:10) ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex not ok 21 navigator should follow an arch going out a vertex Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 22 navigator should follow an arch going in a vertex Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 23 navigator should follow multiple archs, in and out a path Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 24 navigator should follow multiple archs, in and out a path using a stream Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 25 navigator should allow to set the name of the variables Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 26 navigator should allow to bind a variable Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 27 navigator should allow to start the navigation from a variable Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 28 navigator should return the solutions Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 29 navigator should return the solution as a stream Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) ok 30 navigator should return no solution if no condition is specified not ok 31 navigator should return the materialized triples Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 32 navigator should return the materialized triples as a stream Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 33 navigator should go to another vertex Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 34 navigator should go to another vertex as a variable Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) not ok 54 sort join algorithm should do a join with one results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 55 sort join algorithm should do a join with two results Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 56 sort join algorithm should do a join with three conditions Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 57 sort join algorithm should return the two solutions through the searchStream interface Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 58 sort join algorithm should allow to find mutual friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 59 sort join algorithm should allow to intersect common friends Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 60 sort join algorithm should support the friend of a friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 61 sort join algorithm should return triples from a join aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 63 sort join algorithm should emit triples from the stream interface aka materialized API Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 64 sort join algorithm should support filtering inside a condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 65 sort join algorithm should support filtering inside a second-level condition Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 66 sort join algorithm should support solution filtering Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 67 sort join algorithm should return only one solution with limit 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 68 sort join algorithm should return only one solution with limit 1 (bis) Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 69 sort join algorithm should return skip the first solution with offset 1 Error: Not implemented at Level._approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503:9) at Level.AbstractLevelDOWN.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11886:17) at LevelUP.approximateSize (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:16267:11) at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:589:10 at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1315:13 at Array.forEach (native) at _each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1239:24) at Object.async.each (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:1314:9) at planner (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:585:11) at Object.searchStream (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:306:5) not ok 70 sort join algorithm should find homes in paris Error: Uncaught Error: Not implemented (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503) at global.onerror (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/node_modules/mocha/mocha.js:5622:10) ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap not ok 115 deferred open support should support deferred search Error: Uncaught Error: Not implemented (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/1389956204798.dc86eb6.js:11503) at global.onerror (http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/node_modules/mocha/mocha.js:5622:10) not ok 116 deferred open support "after each" hook Error: timeout of 2000ms exceeded at http://git.testling.com/work/mcollina/repos/22597bd0cfa57712f10b9e92e1de1ba12b9dcf54.1389956204226/node_modules/mocha/mocha.js:4241:14 ok 116 Variable should have a name ok 117 Variable should have a name (bis) ok 118 Variable isBound should return true if there is a key in the solution ok 119 Variable isBound should return false if there is no key in the solution ok 120 Variable isBound should return false if there is another key in the solution ok 121 Variable bind should return a different object ok 122 Variable bind should set an element in the solution ok 123 Variable bind should copy values ok 124 Variable isBindable should bind to the same value ok 125 Variable isBindable should not bind to a different value ok 126 Variable isBindable should bind if the key is not present # tests 127 # pass 78 # fail 49
not ok 1 Error: Syntax error on line 17207
2014-01-08 12:54:07
10.0
✓29.0
✓24.0
15.0
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 Variable should have a name ok 116 Variable should have a name (bis) ok 117 Variable isBound should return true if there is a key in the solution ok 118 Variable isBound should return false if there is no key in the solution ok 119 Variable isBound should return false if there is another key in the solution ok 120 Variable bind should return a different object ok 121 Variable bind should set an element in the solution ok 122 Variable bind should copy values ok 123 Variable isBindable should bind to the same value ok 124 Variable isBindable should not bind to a different value ok 125 Variable isBindable should bind if the key is not present # tests 125 # pass 125 # fail 0
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 Variable should have a name ok 116 Variable should have a name (bis) ok 117 Variable isBound should return true if there is a key in the solution ok 118 Variable isBound should return false if there is no key in the solution ok 119 Variable isBound should return false if there is another key in the solution ok 120 Variable bind should return a different object ok 121 Variable bind should set an element in the solution ok 122 Variable bind should copy values ok 123 Variable isBindable should bind to the same value ok 124 Variable isBindable should not bind to a different value ok 125 Variable isBindable should bind if the key is not present # tests 125 # pass 125 # fail 0
not ok 1 Error: Syntax error on line 17197
2014-01-08 12:52:57
10.0
✓29.0
✓24.0
15.0
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 Variable should have a name ok 116 Variable should have a name (bis) ok 117 Variable isBound should return true if there is a key in the solution ok 118 Variable isBound should return false if there is no key in the solution ok 119 Variable isBound should return false if there is another key in the solution ok 120 Variable bind should return a different object ok 121 Variable bind should set an element in the solution ok 122 Variable bind should copy values ok 123 Variable isBindable should bind to the same value ok 124 Variable isBindable should not bind to a different value ok 125 Variable isBindable should bind if the key is not present # tests 125 # pass 125 # fail 0
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 Variable should have a name ok 116 Variable should have a name (bis) ok 117 Variable isBound should return true if there is a key in the solution ok 118 Variable isBound should return false if there is no key in the solution ok 119 Variable isBound should return false if there is another key in the solution ok 120 Variable bind should return a different object ok 121 Variable bind should set an element in the solution ok 122 Variable bind should copy values ok 123 Variable isBindable should bind to the same value ok 124 Variable isBindable should not bind to a different value ok 125 Variable isBindable should bind if the key is not present # tests 125 # pass 125 # fail 0
not ok 1 Error: Syntax error on line 17197
2014-01-08 12:37:13
10.0
29.0
24.0
15.0
timeout waiting to hear back from opera/15.0
1..125 ok 1 basic join algorithm should do a join with one results 1..125 ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 5 basic join algorithm should allow to find mutual friends ok 3 basic join algorithm should do a join with three conditions ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 7 basic join algorithm should support the friend of a friend scenario ok 11 basic join algorithm should support filtering inside a condition ok 8 basic join algorithm should return triples from a join aka materialized API ok 12 basic join algorithm should support filtering inside a second-level condition ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 11 basic join algorithm should support filtering inside a condition ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 12 basic join algorithm should support filtering inside a second-level condition ok 19 creation api should create a db passing a string ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 20 navigator should navigate to a single vertex ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 21 navigator should follow an arch going out a vertex ok 16 basic join algorithm should return skip the first solution with offset 1 ok 22 navigator should follow an arch going in a vertex ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 19 creation api should create a db passing a string ok 26 navigator should allow to bind a variable ok 20 navigator should navigate to a single vertex ok 27 navigator should allow to start the navigation from a variable ok 21 navigator should follow an arch going out a vertex ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 22 navigator should follow an arch going in a vertex ok 30 navigator should return no solution if no condition is specified ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 31 navigator should return the materialized triples ok 25 navigator should allow to set the name of the variables ok 32 navigator should return the materialized triples as a stream ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 28 navigator should return the solutions ok 35 navigator should alias solutions to contexts ok 29 navigator should return the solution as a stream ok 36 navigator should alias solutionStream to contextStream ok 30 navigator should return no solution if no condition is specified ok 37 a basic triple store should put some more data inside a triple ok 31 navigator should return the materialized triples ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 32 navigator should return the materialized triples as a stream ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 33 navigator should go to another vertex ok 55 sort join algorithm should do a join with two results ok 34 navigator should go to another vertex as a variable ok 56 sort join algorithm should do a join with three conditions ok 35 navigator should alias solutions to contexts ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 36 navigator should alias solutionStream to contextStream ok 58 sort join algorithm should allow to find mutual friends ok 37 a basic triple store should put some more data inside a triple ok 59 sort join algorithm should allow to intersect common friends ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 60 sort join algorithm should support the friend of a friend scenario ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 61 sort join algorithm should return triples from a join aka materialized API ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 64 sort join algorithm should support filtering inside a condition ok 58 sort join algorithm should allow to find mutual friends ok 65 sort join algorithm should support filtering inside a second-level condition ok 59 sort join algorithm should allow to intersect common friends ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 60 sort join algorithm should support the friend of a friend scenario ok 69 sort join algorithm should return skip the first solution with offset 1 ok 61 sort join algorithm should return triples from a join aka materialized API ok 70 sort join algorithm should find homes in paris ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 71 sublevel support should put a triple
not ok 1 Error: Syntax error on line 17197
2014-01-07 11:21:27
10.0
✓29.0
✓24.0
15.0
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 Variable should have a name ok 116 Variable should have a name (bis) ok 117 Variable isBound should return true if there is a key in the solution ok 118 Variable isBound should return false if there is no key in the solution ok 119 Variable isBound should return false if there is another key in the solution ok 120 Variable bind should return a different object ok 121 Variable bind should set an element in the solution ok 122 Variable bind should copy values ok 123 Variable isBindable should bind to the same value ok 124 Variable isBindable should not bind to a different value ok 125 Variable isBindable should bind if the key is not present # tests 125 # pass 125 # fail 0
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream ok 82 a basic triple store should support filtering ok 83 a basic triple store with a triple inserted should get it specifiying the subject ok 84 a basic triple store with a triple inserted should get it specifiying the object ok 85 a basic triple store with a triple inserted should get it specifiying the predicate ok 86 a basic triple store with a triple inserted should get it specifiying the subject and the predicate ok 87 a basic triple store with a triple inserted should get it specifiying the subject and the object ok 88 a basic triple store with a triple inserted should get it specifiying the predicate and the object ok 89 a basic triple store with a triple inserted should get nothing if nothing matches an only subject query ok 90 a basic triple store with a triple inserted should get nothing if nothing matches an only predicate query ok 91 a basic triple store with a triple inserted should get nothing if nothing matches an only object query ok 92 a basic triple store with a triple inserted should return the triple through the getStream interface ok 93 a basic triple store with a triple inserted should get the triple if limit 1 is used ok 94 a basic triple store with a triple inserted should get the triple if limit 0 is used ok 95 a basic triple store with a triple inserted should get the triple if offset 0 is used ok 96 a basic triple store with a triple inserted should not get the triple if offset 1 is used ok 97 a basic triple store with two triple inserted with the same predicate should get one by specifiying the subject ok 98 a basic triple store with two triple inserted with the same predicate should get two by specifiying the predicate ok 99 a basic triple store with two triple inserted with the same predicate should remove one and still return the other ok 100 a basic triple store with two triple inserted with the same predicate should return both triples through the getStream interface ok 101 a basic triple store with two triple inserted with the same predicate should return only one triple with limit 1 ok 102 a basic triple store with two triple inserted with the same predicate should return two triples with limit 2 ok 103 a basic triple store with two triple inserted with the same predicate should return three triples with limit 3 ok 104 a basic triple store with two triple inserted with the same predicate should support limit over streams ok 105 a basic triple store with two triple inserted with the same predicate should return only one triple with offset 1 ok 106 a basic triple store with two triple inserted with the same predicate should return only no triples with offset 2 ok 107 a basic triple store with two triple inserted with the same predicate should support offset over streams ok 108 a basic triple store API deprecations should call searchStream when calling joinStream ok 109 a basic triple store API deprecations should alias search to join ok 110 a basic triple store API deprecations should warn when calling joinStream ok 111 a basic triple store API deprecations should warn when calling join ok 112 deferred open support should call the callback if a level is passed ok 113 deferred open support should call the callback if a level is not passed ok 114 deferred open support should call the callback with a levelgrap ok 115 Variable should have a name ok 116 Variable should have a name (bis) ok 117 Variable isBound should return true if there is a key in the solution ok 118 Variable isBound should return false if there is no key in the solution ok 119 Variable isBound should return false if there is another key in the solution ok 120 Variable bind should return a different object ok 121 Variable bind should set an element in the solution ok 122 Variable bind should copy values ok 123 Variable isBindable should bind to the same value ok 124 Variable isBindable should not bind to a different value ok 125 Variable isBindable should bind if the key is not present # tests 125 # pass 125 # fail 0
not ok 1 Error: Syntax error on line 17197
2014-01-07 10:18:57
10.0
✓29.0
24.0
15.0
1..125 ok 1 basic join algorithm should do a join with one results ok 2 basic join algorithm should do a join with two results ok 3 basic join algorithm should do a join with three conditions ok 4 basic join algorithm should return the two solutions through the searchStream interface ok 5 basic join algorithm should allow to find mutual friends ok 6 basic join algorithm should allow to intersect common friends ok 7 basic join algorithm should support the friend of a friend scenario ok 8 basic join algorithm should return triples from a join aka materialized API ok 9 basic join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 10 basic join algorithm should emit triples from the stream interface aka materialized API ok 11 basic join algorithm should support filtering inside a condition ok 12 basic join algorithm should support filtering inside a second-level condition ok 13 basic join algorithm should support solution filtering ok 14 basic join algorithm should return only one solution with limit 1 ok 15 basic join algorithm should return only one solution with limit 1 (bis) ok 16 basic join algorithm should return skip the first solution with offset 1 ok 17 basic join algorithm should find homes in paris ok 18 creation api should create a db passing a levelup instance ok 19 creation api should create a db passing a string ok 20 navigator should navigate to a single vertex ok 21 navigator should follow an arch going out a vertex ok 22 navigator should follow an arch going in a vertex ok 23 navigator should follow multiple archs, in and out a path ok 24 navigator should follow multiple archs, in and out a path using a stream ok 25 navigator should allow to set the name of the variables ok 26 navigator should allow to bind a variable ok 27 navigator should allow to start the navigation from a variable ok 28 navigator should return the solutions ok 29 navigator should return the solution as a stream ok 30 navigator should return no solution if no condition is specified ok 31 navigator should return the materialized triples ok 32 navigator should return the materialized triples as a stream ok 33 navigator should go to another vertex ok 34 navigator should go to another vertex as a variable ok 35 navigator should alias solutions to contexts ok 36 navigator should alias solutionStream to contextStream ok 37 a basic triple store should put some more data inside a triple ok 38 a basic triple store should return the inserted data ok 39 query planner with basic algorithm should return a single condition as-is ok 40 query planner with basic algorithm should order two conditions based on their size ok 41 query planner with basic algorithm should order two conditions based on their size (bis) ok 42 query planner with basic algorithm should avoid variables ok 43 query planner with sort algorithm should return a single condition with the JoinStream ok 44 query planner with sort algorithm should put the second condition in the same order as the first ok 45 query planner with sort algorithm should create the proper index for the friend-of-a-friend query ok 46 query planner with sort algorithm should use a SortJoinStream for a three-conditions query ok 47 query planner with sort algorithm should support inverting the index even on three-conditions queries ok 48 query planner with sort algorithm should put the variables from the previous condition in the same order ok 49 query planner with sort algorithm should use a SortJoinStream for another three-conditions query ok 50 query planner with sort algorithm should use a SortJoinStream for the friend-of-a-friend-of-a-friend scenario ok 51 query planner with sort algorithm should pick the correct indexes with multiple predicates going out the same subject ok 52 query planner without approximateSize should order two conditions based on their size ok 53 query planner without approximateSize should order two conditions based on their size (bis) ok 54 sort join algorithm should do a join with one results ok 55 sort join algorithm should do a join with two results ok 56 sort join algorithm should do a join with three conditions ok 57 sort join algorithm should return the two solutions through the searchStream interface ok 58 sort join algorithm should allow to find mutual friends ok 59 sort join algorithm should allow to intersect common friends ok 60 sort join algorithm should support the friend of a friend scenario ok 61 sort join algorithm should return triples from a join aka materialized API ok 62 sort join algorithm should support a friend-of-a-friend-of-a-friend scenario ok 63 sort join algorithm should emit triples from the stream interface aka materialized API ok 64 sort join algorithm should support filtering inside a condition ok 65 sort join algorithm should support filtering inside a second-level condition ok 66 sort join algorithm should support solution filtering ok 67 sort join algorithm should return only one solution with limit 1 ok 68 sort join algorithm should return only one solution with limit 1 (bis) ok 69 sort join algorithm should return skip the first solution with offset 1 ok 70 sort join algorithm should find homes in paris ok 71 sublevel support should put a triple ok 72 sublevel support should get a triple ok 73 sublevel support should put a triple with a stream ok 74 sublevel support should not close anything ok 75 a basic triple store should put a triple ok 76 a basic triple store should put an array of triples ok 77 a basic triple store should get only triples with exact match of subjects ok 78 a basic triple store should put a triple with an object to false ok 79 a basic triple store should put triples using a stream ok 80 a basic triple store should store the triples written using a stream ok 81 a basic triple store should del the triples using a stream