Method remove

Fleece/Tree/MutableNode.hh:218–254

        bool remove(Target target, unsigned shift) {
            assert_precondition(shift + kBitShift < 8*sizeof(hash_t));
            unsigned bitNo = childBitNumber(target.hash, shift);
            if (!hasChild(bitNo))
                return false;
            unsigned childIndex = childIndexForBitNumber(bitNo);
            NodeRef childRef = _children[childIndex];
            if (childRef.isLeaf()) {
                // Child is a leaf -- is it the right key?
                if (childRef.matches(target)) {
                    removeChild(bitNo, childIndex);
                    delete (MutableLeaf*)childRef.asMutable();
                    return true;
                } else {
                    return false;
                }
            } else {
                // Recurse into child node...
                auto child = (MutableInterior*)childRef.asMutable();
                if (child) {
                    if (!child->remove(target, shift+kBitShift))
                        return false;
                } else {
                    child = mutableCopy(&childRef.asImmutable()->interior);
                    if (!child->remove(target, shift+kBitShift)) {
                        delete child;
                        return false;
                    }
                    _children[childIndex] = child;
                }
                if (child->_bitmap.empty()) {
                    removeChild(bitNo, childIndex);     // child node is now empty, so remove it
                    delete child;
                }
                return true;
            }
        }


        static offset_t encodeImmutableOffset(const Node *inode, offset_t off, const Encoder &enc) {