(boxes, d, data, ids)
| 6318 | |
| 6319 | //Unpack boxes into a flat typed array, remove empty boxes |
| 6320 | function convertBoxes(boxes, d, data, ids) { |
| 6321 | var ptr = 0 |
| 6322 | var count = 0 |
| 6323 | for(var i=0, n=boxes.length; i<n; ++i) { |
| 6324 | var b = boxes[i] |
| 6325 | if(boxEmpty(d, b)) { |
| 6326 | continue |
| 6327 | } |
| 6328 | for(var j=0; j<2*d; ++j) { |
| 6329 | data[ptr++] = b[j] |
| 6330 | } |
| 6331 | ids[count++] = i |
| 6332 | } |
| 6333 | return count |
| 6334 | } |
| 6335 | |
| 6336 | //Perform type conversions, check bounds |
| 6337 | function boxIntersect(red, blue, visit, full) { |
no test coverage detected
searching dependent graphs…