Searched refs:newRoot (Results 1 – 7 of 7) sorted by relevance
87 auto newRoot = which.kid[toggler], orphan = which.kid[!toggler]; in FreeTree() local88 which = newRoot; in FreeTree()89 for (Node* n = void; (n = newRoot.kid[!toggler]) !is null; ) in FreeTree()91 newRoot = n; in FreeTree()93 newRoot.kid[!toggler] = orphan; in FreeTree()
401 auto newRoot = cast(Node*) (result + actualBytes); in allocate() local402 newRoot.next = root.next; in allocate()403 newRoot.size = balance; in allocate()404 root = newRoot; in allocate()
1011 auto newRoot = cast(shared Node*) b.ptr; in deallocate() local1013 newRoot.next = _root; in deallocate()1014 _root = newRoot; in deallocate()
90 auto newRoot = which.kid[toggler], orphan = which.kid[!toggler]; in FreeTree() local91 which = newRoot; in FreeTree()92 for (Node* n = void; (n = newRoot.kid[!toggler]) !is null; ) in FreeTree()94 newRoot = n; in FreeTree()96 newRoot.kid[!toggler] = orphan; in FreeTree()
416 auto newRoot = cast(Node*) (result + actualBytes); in allocate() local417 newRoot.next = root.next; in allocate()418 newRoot.size = balance; in allocate()419 root = newRoot; in allocate()
1093 auto newRoot = cast(shared Node*) b.ptr; in deallocate() local1095 newRoot.next = _root; in deallocate()1096 _root = newRoot; in deallocate()
350 Node * n, newRoot; in SList() local354 (newRoot ? n._next : newRoot) = newNode; in SList()361 _first = newRoot; in SList()370 auto newRoot = new Node(_first, stuff); in SList() local371 _first = newRoot; in SList()