new_anti is badly designed

[BruJu]

https://github.com/BruJu/Portable-Reasoning-in-Web-Assembly/blob/531e17b21383fcffd5bb2d4f92f39ebee2cbe195/bjdatasets/src/treeddataset.rs#L42

In intent, new_anti builds a tree that prioritizes the indexes that are the inverse of the one used by the RDFJS match function.

The purpose is to fill the produced tree in "random" order to avoid having a tree of height number of elements / 2B.

The current design fails to do so because quads sorted in SPOG order, filled in a OGSP tree, where every S and P are the same produces the same tree as in a SPOG tree (the important thing is to not sort by O then G but by G then O)