Compiling Time: 47ms.

Range check: (index:0, size:1)        //add point
---------------------------------
Range check: (index:0, size:1)        //add point
---------------------------------
Range check: (index:0, size:1)        //add point
Dividing index: 0, because: (-1, -1, -1, -1)  //but node is filled. So we divide and add 4 adjacent nodes
Divide got idx: 0
1, 2, 3, 4                            //alright, this is good. Now enter first node (index 1), test if it fits. Add to it's list

------- > function TQuadTree.Insert(p, northWest)
Range check: (index:0, size:5)        //WOOOOOT THE INDEX IS 0??? Something went to hell!
Dividing index: 0, because: (-1, -1, -1, -1) //WOOOOT, WE ARE DIVIDING????
Divide got idx: 0                     //THIS IS BAD
5, 6, 7, 8
Range check: (index:5, size:9)



... adds more points (... ignore this, shit's already shown to be broken)
---------------------------------
Range check: (index:0, size:9)
5, -1, -1, -1
Range check: (index:5, size:9)
---------------------------------
Range check: (index:0, size:9)
5, -1, -1, -1
Range check: (index:5, size:9)
Dividing index: 5, because: (-1, -1, -1, -1)
Divide got idx: 5
9, 10, 11, 12
Range check: (index:9, size:13)
Range check: (index:10, size:13)
---------------------------------
Range check: (index:0, size:13)
5, -1, -1, -1
Range check: (index:5, size:13)
9, 10, 11, 12
Range check: (index:9, size:13)
Range check: (index:10, size:13)
---------------------------------
Range check: (index:0, size:13)
5, -1, -1, -1
Range check: (index:5, size:13)
Range check: (index:-1, size:13)
Runtime error: "Range check: (index:0, size:13)" at line 80, column 19