|
| 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 | +#include "iceberg/update/replace_sort_order.h" |
| 21 | + |
| 22 | +#include <memory> |
| 23 | +#include <string> |
| 24 | +#include <vector> |
| 25 | + |
| 26 | +#include <gmock/gmock.h> |
| 27 | +#include <gtest/gtest.h> |
| 28 | + |
| 29 | +#include "iceberg/expression/term.h" |
| 30 | +#include "iceberg/result.h" |
| 31 | +#include "iceberg/schema.h" |
| 32 | +#include "iceberg/schema_field.h" |
| 33 | +#include "iceberg/sort_field.h" |
| 34 | +#include "iceberg/table.h" |
| 35 | +#include "iceberg/table_identifier.h" |
| 36 | +#include "iceberg/table_metadata.h" |
| 37 | +#include "iceberg/test/matchers.h" |
| 38 | +#include "iceberg/test/mock_catalog.h" |
| 39 | +#include "iceberg/transform.h" |
| 40 | + |
| 41 | +namespace iceberg { |
| 42 | + |
| 43 | +class ReplaceSortOrderTest : public ::testing::Test { |
| 44 | + protected: |
| 45 | + void SetUp() override { |
| 46 | + // Create a simple schema with various field types |
| 47 | + SchemaField field1(1, "id", std::make_shared<LongType>(), false); |
| 48 | + SchemaField field2(2, "name", std::make_shared<StringType>(), true); |
| 49 | + SchemaField field3(3, "ts", std::make_shared<TimestampType>(), true); |
| 50 | + SchemaField field4(4, "price", std::make_shared<DecimalType>(10, 2), true); |
| 51 | + schema_ = std::make_shared<Schema>( |
| 52 | + std::vector<SchemaField>{field1, field2, field3, field4}, 1); |
| 53 | + |
| 54 | + // Create basic table metadata |
| 55 | + metadata_ = std::make_shared<TableMetadata>(); |
| 56 | + metadata_->schemas.push_back(schema_); |
| 57 | + metadata_->current_schema_id = 1; |
| 58 | + |
| 59 | + // Create catalog and table identifier |
| 60 | + catalog_ = std::make_shared<MockCatalog>(); |
| 61 | + identifier_ = TableIdentifier(Namespace({"test"}), "table"); |
| 62 | + } |
| 63 | + |
| 64 | + std::shared_ptr<Schema> schema_; |
| 65 | + std::shared_ptr<TableMetadata> metadata_; |
| 66 | + std::shared_ptr<MockCatalog> catalog_; |
| 67 | + TableIdentifier identifier_; |
| 68 | +}; |
| 69 | + |
| 70 | +TEST_F(ReplaceSortOrderTest, AscendingSingleField) { |
| 71 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 72 | + |
| 73 | + auto ref = NamedReference::Make("id").value(); |
| 74 | + auto term = UnboundTransform::Make(std::move(ref), Transform::Identity()).value(); |
| 75 | + |
| 76 | + update.Asc(std::move(term), NullOrder::kFirst); |
| 77 | + |
| 78 | + auto result = update.Apply(); |
| 79 | + EXPECT_THAT(result, IsOk()); |
| 80 | + |
| 81 | + auto sort_order = update.GetBuiltSortOrder(); |
| 82 | + ASSERT_NE(sort_order, nullptr); |
| 83 | + EXPECT_EQ(sort_order->fields().size(), 1); |
| 84 | + |
| 85 | + const auto& field = sort_order->fields()[0]; |
| 86 | + EXPECT_EQ(field.source_id(), 1); |
| 87 | + EXPECT_EQ(field.direction(), SortDirection::kAscending); |
| 88 | + EXPECT_EQ(field.null_order(), NullOrder::kFirst); |
| 89 | +} |
| 90 | + |
| 91 | +TEST_F(ReplaceSortOrderTest, DescendingSingleField) { |
| 92 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 93 | + |
| 94 | + auto ref = NamedReference::Make("name").value(); |
| 95 | + auto term = UnboundTransform::Make(std::move(ref), Transform::Identity()).value(); |
| 96 | + |
| 97 | + update.Desc(std::move(term), NullOrder::kLast); |
| 98 | + |
| 99 | + auto result = update.Apply(); |
| 100 | + EXPECT_THAT(result, IsOk()); |
| 101 | + |
| 102 | + auto sort_order = update.GetBuiltSortOrder(); |
| 103 | + ASSERT_NE(sort_order, nullptr); |
| 104 | + EXPECT_EQ(sort_order->fields().size(), 1); |
| 105 | + |
| 106 | + const auto& field = sort_order->fields()[0]; |
| 107 | + EXPECT_EQ(field.source_id(), 2); |
| 108 | + EXPECT_EQ(field.direction(), SortDirection::kDescending); |
| 109 | + EXPECT_EQ(field.null_order(), NullOrder::kLast); |
| 110 | +} |
| 111 | + |
| 112 | +TEST_F(ReplaceSortOrderTest, MultipleFields) { |
| 113 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 114 | + |
| 115 | + auto ref1 = NamedReference::Make("name").value(); |
| 116 | + auto term1 = UnboundTransform::Make(std::move(ref1), Transform::Identity()).value(); |
| 117 | + |
| 118 | + auto ref2 = NamedReference::Make("id").value(); |
| 119 | + auto term2 = UnboundTransform::Make(std::move(ref2), Transform::Identity()).value(); |
| 120 | + |
| 121 | + update.Asc(std::move(term1), NullOrder::kFirst) |
| 122 | + .Desc(std::move(term2), NullOrder::kLast); |
| 123 | + |
| 124 | + auto result = update.Apply(); |
| 125 | + EXPECT_THAT(result, IsOk()); |
| 126 | + |
| 127 | + auto sort_order = update.GetBuiltSortOrder(); |
| 128 | + ASSERT_NE(sort_order, nullptr); |
| 129 | + EXPECT_EQ(sort_order->fields().size(), 2); |
| 130 | + |
| 131 | + // Check first field |
| 132 | + const auto& field1 = sort_order->fields()[0]; |
| 133 | + EXPECT_EQ(field1.source_id(), 2); // name field |
| 134 | + EXPECT_EQ(field1.direction(), SortDirection::kAscending); |
| 135 | + EXPECT_EQ(field1.null_order(), NullOrder::kFirst); |
| 136 | + |
| 137 | + // Check second field |
| 138 | + const auto& field2 = sort_order->fields()[1]; |
| 139 | + EXPECT_EQ(field2.source_id(), 1); // id field |
| 140 | + EXPECT_EQ(field2.direction(), SortDirection::kDescending); |
| 141 | + EXPECT_EQ(field2.null_order(), NullOrder::kLast); |
| 142 | +} |
| 143 | + |
| 144 | +TEST_F(ReplaceSortOrderTest, WithTransform) { |
| 145 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 146 | + |
| 147 | + auto ref = NamedReference::Make("ts").value(); |
| 148 | + auto term = UnboundTransform::Make(std::move(ref), Transform::Day()).value(); |
| 149 | + |
| 150 | + update.Asc(std::move(term), NullOrder::kFirst); |
| 151 | + |
| 152 | + auto result = update.Apply(); |
| 153 | + EXPECT_THAT(result, IsOk()); |
| 154 | + |
| 155 | + auto sort_order = update.GetBuiltSortOrder(); |
| 156 | + ASSERT_NE(sort_order, nullptr); |
| 157 | + EXPECT_EQ(sort_order->fields().size(), 1); |
| 158 | + |
| 159 | + const auto& field = sort_order->fields()[0]; |
| 160 | + EXPECT_EQ(field.source_id(), 3); |
| 161 | + EXPECT_EQ(field.transform()->ToString(), "day"); |
| 162 | + EXPECT_EQ(field.direction(), SortDirection::kAscending); |
| 163 | + EXPECT_EQ(field.null_order(), NullOrder::kFirst); |
| 164 | +} |
| 165 | + |
| 166 | +TEST_F(ReplaceSortOrderTest, WithBucketTransform) { |
| 167 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 168 | + |
| 169 | + auto ref = NamedReference::Make("name").value(); |
| 170 | + auto term = UnboundTransform::Make(std::move(ref), Transform::Bucket(10)).value(); |
| 171 | + |
| 172 | + update.Desc(std::move(term), NullOrder::kLast); |
| 173 | + |
| 174 | + auto result = update.Apply(); |
| 175 | + EXPECT_THAT(result, IsOk()); |
| 176 | + |
| 177 | + auto sort_order = update.GetBuiltSortOrder(); |
| 178 | + ASSERT_NE(sort_order, nullptr); |
| 179 | + EXPECT_EQ(sort_order->fields().size(), 1); |
| 180 | + |
| 181 | + const auto& field = sort_order->fields()[0]; |
| 182 | + EXPECT_EQ(field.source_id(), 2); |
| 183 | + EXPECT_EQ(field.transform()->ToString(), "bucket[10]"); |
| 184 | + EXPECT_EQ(field.direction(), SortDirection::kDescending); |
| 185 | + EXPECT_EQ(field.null_order(), NullOrder::kLast); |
| 186 | +} |
| 187 | + |
| 188 | +TEST_F(ReplaceSortOrderTest, NullTerm) { |
| 189 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 190 | + |
| 191 | + update.Asc(nullptr, NullOrder::kFirst); |
| 192 | + |
| 193 | + auto result = update.Apply(); |
| 194 | + EXPECT_THAT(result, IsError(ErrorKind::kValidationFailed)); |
| 195 | + EXPECT_THAT(result, HasErrorMessage("Term cannot be null")); |
| 196 | +} |
| 197 | + |
| 198 | +TEST_F(ReplaceSortOrderTest, InvalidTransformForType) { |
| 199 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 200 | + |
| 201 | + // Try to apply day transform to a string field (invalid) |
| 202 | + auto ref = NamedReference::Make("name").value(); |
| 203 | + auto term = UnboundTransform::Make(std::move(ref), Transform::Day()).value(); |
| 204 | + |
| 205 | + update.Asc(std::move(term), NullOrder::kFirst); |
| 206 | + |
| 207 | + auto result = update.Apply(); |
| 208 | + EXPECT_THAT(result, IsError(ErrorKind::kValidationFailed)); |
| 209 | + EXPECT_THAT(result, HasErrorMessage("not a valid input type")); |
| 210 | +} |
| 211 | + |
| 212 | +TEST_F(ReplaceSortOrderTest, NonExistentField) { |
| 213 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 214 | + |
| 215 | + auto ref = NamedReference::Make("nonexistent").value(); |
| 216 | + auto term = UnboundTransform::Make(std::move(ref), Transform::Identity()).value(); |
| 217 | + |
| 218 | + update.Asc(std::move(term), NullOrder::kFirst); |
| 219 | + |
| 220 | + auto result = update.Apply(); |
| 221 | + EXPECT_THAT(result, IsError(ErrorKind::kValidationFailed)); |
| 222 | + EXPECT_THAT(result, HasErrorMessage("Cannot find")); |
| 223 | +} |
| 224 | + |
| 225 | +TEST_F(ReplaceSortOrderTest, CaseSensitiveTrue) { |
| 226 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 227 | + |
| 228 | + auto ref = NamedReference::Make("ID").value(); // Uppercase |
| 229 | + auto term = UnboundTransform::Make(std::move(ref), Transform::Identity()).value(); |
| 230 | + |
| 231 | + update.CaseSensitive(true).Asc(std::move(term), NullOrder::kFirst); |
| 232 | + |
| 233 | + auto result = update.Apply(); |
| 234 | + // Should fail because schema has "id" (lowercase) |
| 235 | + EXPECT_THAT(result, IsError(ErrorKind::kValidationFailed)); |
| 236 | +} |
| 237 | + |
| 238 | +TEST_F(ReplaceSortOrderTest, CaseSensitiveFalse) { |
| 239 | + ReplaceSortOrder update(identifier_, catalog_, metadata_); |
| 240 | + |
| 241 | + auto ref = NamedReference::Make("ID").value(); // Uppercase |
| 242 | + auto term = UnboundTransform::Make(std::move(ref), Transform::Identity()).value(); |
| 243 | + |
| 244 | + update.CaseSensitive(false).Asc(std::move(term), NullOrder::kFirst); |
| 245 | + |
| 246 | + auto result = update.Apply(); |
| 247 | + // Should succeed because case-insensitive matching |
| 248 | + EXPECT_THAT(result, IsOk()); |
| 249 | + |
| 250 | + auto sort_order = update.GetBuiltSortOrder(); |
| 251 | + ASSERT_NE(sort_order, nullptr); |
| 252 | + EXPECT_EQ(sort_order->fields().size(), 1); |
| 253 | + EXPECT_EQ(sort_order->fields()[0].source_id(), 1); |
| 254 | +} |
| 255 | + |
| 256 | +} // namespace iceberg |
0 commit comments