Method clear

src/common/classes/sparse_bitmap.h:128–156

	}

	bool clear(T value)
	{
		if (singular)
		{
			fb_assert(tree.isEmpty());

			if (value == singular_value)
			{
				singular = false;
				return true;
			}
			return false;
		}

		const T val_aligned = value & ~(T)(BUNCH_BITS - 1);
		if (tree.isPositioned(val_aligned) || tree.locate(val_aligned))
		{
			const BUNCH_T bit_mask = BUNCH_ONE << (value - val_aligned);
			Bucket *current_bucket = &tree.current();
			if (current_bucket->bits & bit_mask)
			{
				current_bucket->bits &= ~bit_mask;
				if (!current_bucket->bits)
					tree.fastRemove();
				return true;
			}
		}
		return false;
	}

	bool test(T value)
	{