(pt)
| 269 | } |
| 270 | |
| 271 | function updateEdgesForReentry(pt) { |
| 272 | // if we're outside the nearby region and going back in, |
| 273 | // we may need to loop around a corner point |
| 274 | if(pts[pti - 1][0] !== pt[0] && pts[pti - 1][1] !== pt[1]) { |
| 275 | updateEdge([lastXEdge, lastYEdge]); |
| 276 | } |
| 277 | updateEdge(pt); |
| 278 | lastFarPt = null; |
| 279 | lastXEdge = lastYEdge = 0; |
| 280 | } |
| 281 | |
| 282 | var arrayMarker = Lib.isArrayOrTypedArray(marker); |
| 283 |
no test coverage detected
searching dependent graphs…