GitHub PushEvent at 2014-12-08 22:19:55
Repository: SCM-Prolog
Actor: m1trix
Payload: {"shas":[["b98eaa37273a9188ccd671b1456b5c7b96741303","31e64badc02f44e884612e78d63e7af68e2fc702@gmail.com","NEW: Faster PrologVariables binding.\n\nThe new logic is based on the disjoint set data structure. When two\nPrologVariables are bound to one another, the right becomes a child of\nthe left. If we are binding the roots of large bounds-trees, the right\nroot becomes a child of the left. If we are binding variables,\nthat are not the roots of their respecitive bounds-trees, the roots are\nfound recursively and they are bound instead.\n\nThis trees are built very fast, but the iterations inside them are slow,\nso every time we seek the root of a tree, all variables that are in the\nchain of variables to the root (moving from the leaves up), are moved up so\nthat they become direct children of the root variable. If we iterate\nmore often, the tree will become more and more short and the iterations will\nbecome with constant complexity.\n\nOnly the root can point to a value. If the root points to a value, all variables from the same bounds-tree point to the same value, given\nthat they take it from the root variable.","m1trix",true]],"size":1,"ref":"refs/heads/FasterInterpreter","head":"b98eaa37273a9188ccd671b1456b5c7b96741303"}