(start, minX, minY, size)
| 1954 | |
| 1955 | // interlink polygon nodes in z-order |
| 1956 | function indexCurve(start, minX, minY, size) { |
| 1957 | var p = start; |
| 1958 | do { |
| 1959 | if (p.z === null) p.z = zOrder(p.x, p.y, minX, minY, size); |
| 1960 | p.prevZ = p.prev; |
| 1961 | p.nextZ = p.next; |
| 1962 | p = p.next; |
| 1963 | } while (p !== start); |
| 1964 | |
| 1965 | p.prevZ.nextZ = null; |
| 1966 | p.prevZ = null; |
| 1967 | |
| 1968 | sortLinked(p); |
| 1969 | } |
| 1970 | |
| 1971 | // Simon Tatham's linked list merge sort algorithm |
| 1972 | // http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html |
no test coverage detected