( edit: number, frag: number, child: Node<K, V>, bitmap: number, subNodes: Array<Node<K, V>> )
| 325 | } |
| 326 | |
| 327 | function expand<K, V>( |
| 328 | edit: number, |
| 329 | frag: number, |
| 330 | child: Node<K, V>, |
| 331 | bitmap: number, |
| 332 | subNodes: Array<Node<K, V>> |
| 333 | ) { |
| 334 | const arr = [] |
| 335 | let bit = bitmap |
| 336 | let count = 0 |
| 337 | for (let i = 0; bit; ++i) { |
| 338 | if (bit & 1) arr[i] = subNodes[count++]! |
| 339 | bit >>>= 1 |
| 340 | } |
| 341 | arr[frag] = child |
| 342 | return new ArrayNode(edit, count + 1, arr) |
| 343 | } |
| 344 | |
| 345 | function mergeLeavesInner<K, V>( |
| 346 | edit: number, |
no outgoing calls
no test coverage detected
searching dependent graphs…