Ruby: Make module graph queries avoid relying on evalaution order.

[alexet]

Graphs use the internal id if semmle.order is not good enough. However the internal id of a newtype depends on evaluation order (and in this case whether TResolved or TUnresolved is evaluated first). It seems the current evaluator is very consistent but RTJO changes it. In theory though the current evaluator could get the wrong result as multiple threads can change scheduling order.

I am looking into using the label as an intermediate order. However we end up still needing us to make this deterministic as an intermediate step as we can't fix the ruby tests and make the result processing change atomically.

This just adds the toString as an order when the location is not defined, I have put these first in the order as that matches the existing results better (if semmle.order is not defined then it is 0).

I have duplicated this as it is already duplicated but I am happy to put this in a qll instead as this code has grown in size.