()
| 371 | }; |
| 372 | var INTEGER = /^\d+$/; |
| 373 | var getPoolFunctions = () => { |
| 374 | const pool = []; |
| 375 | let nextId = 0; |
| 376 | return [ |
| 377 | (reuse) => (reuse ? arrayShift(pool) : null) ?? EMPTY_STRING + nextId++, |
| 378 | (id2) => { |
| 379 | if (test(INTEGER, id2) && size(pool) < 1e3) { |
| 380 | arrayPush(pool, id2); |
| 381 | } |
| 382 | } |
| 383 | ]; |
| 384 | }; |
| 385 | var getWildcardedLeaves = (deepIdSet, path = [EMPTY_STRING]) => { |
| 386 | const leaves = []; |
| 387 | const deep = (node, p) => p == size(path) ? arrayPush(leaves, node) : isNull(path[p]) ? collForEach(node, (node2) => deep(node2, p + 1)) : arrayForEach([path[p], null], (id2) => deep(mapGet(node, id2), p + 1)); |
no test coverage detected
searching dependent graphs…