summaryrefslogtreecommitdiff
path: root/test/fixtures/json/bad/not.json
diff options
context:
space:
mode:
authorDan Goodliffe <dan@randomdan.homeip.net>2024-06-30 19:05:02 +0100
committerDan Goodliffe <dan@randomdan.homeip.net>2024-06-30 19:05:05 +0100
commitf83d7cc0e2f0f6558783a5f3f146c10417e9225a (patch)
treec25d723d8e9a3954b41f48c0e7e64d7a6ed8e1cd /test/fixtures/json/bad/not.json
parentFix run rules for perfs (diff)
downloadilt-f83d7cc0e2f0f6558783a5f3f146c10417e9225a.tar.bz2
ilt-f83d7cc0e2f0f6558783a5f3f146c10417e9225a.tar.xz
ilt-f83d7cc0e2f0f6558783a5f3f146c10417e9225a.zip
Add an InstanceVertices partition perf test
Summary: * Given a trivially simple condition, like a bounding box, over 1 million items can be partitioned in under 3ms. * Parallel algorithms reduce that a little but are only effective with volumes in excess ~200k, this might be better with a more complex condition/predicate.
Diffstat (limited to 'test/fixtures/json/bad/not.json')
0 files changed, 0 insertions, 0 deletions