return (int)b-(int)a;
});
this.node_lines.sort((a,b) => {
- return (int)b-(int)a;
+ return (int)a-(int)b;
});
}
public Node? lineToNode(int line)
{
print("Searching for line %d\n",line);
var l = -1;
+ foreach(int el in this.node_lines) {
+ print("all lines %d\n", el);
+ }
+
+
foreach(int el in this.node_lines) {
print("?match %d\n", el);
if (el < line) {
if (el == line) {
print("SAME\n");
l = el;
+ break;
}
if (l > -1) {
print("RETURNING NODE ON LINE %d", l);