florijan be16409da2 Harness MATCH tests refactored ... Summary: 1. Test setup rewritten to take cca 8 seconds. Note that edges are created by using: `MATCH (a) WITH a MATCH (b) WITH b WHERE rand() < X CREATE (a)-[:ET]->(b)` Where `X` is a threshold calculated so the desired edge count is the expectation. This seems the only feasable way of generating a large number of edges since query execution does not depend on edge count, but on vertex count. 2. Using the new `assert` function to verify graph state. I recommend doing that in all the harness tests (I don't think we currently have something better). 3. All tests rewritten to take around 200ms per iteration. 4. Test are using SKIP to avoid sending data to the client, but ensure that appropriate operations get executed. This currently seems like the best way of removing unwanted side-effects. Harness will cost us our sanity. And it doesn't even provide good quality regression testing we really need :( Reviewers: buda, mislav.bradac, mferencevic Reviewed By: mferencevic Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D752		2017-09-07 12:05:05 +02:00
..
apollo	Harness MATCH tests refactored	2017-09-07 12:05:05 +02:00
gdb-plugins	Improve pointer handling in operator_tree gdb plugin	2017-08-22 10:13:49 +02:00
csv_to_snapshot	csv_to_snapshot: Treat empty csv field as null	2017-09-01 14:30:59 +02:00
neo_to_memgraph.py	Upgraded neo2memgraph script	2017-07-14 17:13:08 +02:00
plot_gbench_json	GBench plot tool improvement	2017-09-07 11:24:03 +02:00
plot_ldbc_latency	ldbc: Use a part of the query name for x-tick labels	2017-09-07 11:57:58 +02:00