iceberg-cpp
Loading...
Searching...
No Matches
position_delete_index.h
Go to the documentation of this file.
1/*
2 * Licensed to the Apache Software Foundation (ASF) under one
3 * or more contributor license agreements. See the NOTICE file
4 * distributed with this work for additional information
5 * regarding copyright ownership. The ASF licenses this file
6 * to you under the Apache License, Version 2.0 (the
7 * "License"); you may not use this file except in compliance
8 * with the License. You may obtain a copy of the License at
9 *
10 * http://www.apache.org/licenses/LICENSE-2.0
11 *
12 * Unless required by applicable law or agreed to in writing,
13 * software distributed under the License is distributed on an
14 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15 * KIND, either express or implied. See the License for the
16 * specific language governing permissions and limitations
17 * under the License.
18 */
19
20#pragma once
21
24
25#include <cstdint>
26#include <memory>
27#include <span>
28#include <vector>
29
31#include "iceberg/iceberg_data_export.h"
32
33namespace iceberg {
34
40class ICEBERG_DATA_EXPORT PositionDeleteIndex {
41 public:
42 PositionDeleteIndex() = default;
43 ~PositionDeleteIndex() = default;
44
47 void Delete(int64_t pos);
48
52 void Delete(int64_t pos_start, int64_t pos_end);
53
57 bool IsDeleted(int64_t pos) const;
58
60 bool IsEmpty() const;
61
63 int64_t Cardinality() const;
64
67 void Merge(const PositionDeleteIndex& other);
68
69 private:
70 // Bulk-add positions sharing high-32-bit `key`. Private hook for
71 // `ForEachPositionDelete`'s bulk path; keeps `Delete` the sole public
72 // mutation surface.
73 void BulkAddForKey(int32_t key, std::span<const uint32_t> positions);
74
75 friend void ICEBERG_DATA_EXPORT
76 ForEachPositionDelete(std::span<const int64_t> positions, PositionDeleteIndex& target,
77 std::vector<uint32_t>& scratch);
78
80};
81
82} // namespace iceberg
Tracks deleted row positions using a bitmap.
Definition position_delete_index.h:40
A bitmap that supports positive 64-bit positions, optimized for cases where most positions fit in 32 ...
Definition roaring_position_bitmap.h:51