|
26 | 26 |
|
27 | 27 | #include "iceberg/schema.h" |
28 | 28 | #include "iceberg/sort_field.h" |
| 29 | +#include "iceberg/test/matchers.h" |
29 | 30 | #include "iceberg/transform.h" |
30 | 31 | #include "iceberg/util/formatter.h" // IWYU pragma: keep |
31 | 32 |
|
32 | 33 | namespace iceberg { |
33 | 34 |
|
| 35 | +class SortOrderMakeTest : public ::testing::Test { |
| 36 | + protected: |
| 37 | + void SetUp() override { |
| 38 | + field1_ = std::make_unique<SchemaField>(1, "x", int32(), true); |
| 39 | + field2_ = std::make_unique<SchemaField>(2, "y", string(), true); |
| 40 | + field3_ = std::make_unique<SchemaField>(3, "time", timestamp(), true); |
| 41 | + |
| 42 | + schema_ = std::make_unique<Schema>( |
| 43 | + std::vector<SchemaField>{*field1_, *field2_, *field3_}, 1); |
| 44 | + |
| 45 | + sort_field1_ = std::make_unique<SortField>( |
| 46 | + 1, Transform::Identity(), SortDirection::kAscending, NullOrder::kFirst); |
| 47 | + sort_field2_ = std::make_unique<SortField>( |
| 48 | + 2, Transform::Bucket(10), SortDirection::kDescending, NullOrder::kLast); |
| 49 | + sort_field3_ = std::make_unique<SortField>( |
| 50 | + 3, Transform::Day(), SortDirection::kAscending, NullOrder::kFirst); |
| 51 | + } |
| 52 | + |
| 53 | + std::unique_ptr<Schema> schema_; |
| 54 | + std::unique_ptr<SchemaField> field1_; |
| 55 | + std::unique_ptr<SchemaField> field2_; |
| 56 | + std::unique_ptr<SchemaField> field3_; |
| 57 | + |
| 58 | + std::unique_ptr<SortField> sort_field1_; |
| 59 | + std::unique_ptr<SortField> sort_field2_; |
| 60 | + std::unique_ptr<SortField> sort_field3_; |
| 61 | +}; |
| 62 | + |
34 | 63 | TEST(SortOrderTest, Basics) { |
35 | 64 | { |
36 | 65 | SchemaField field1(5, "ts", iceberg::timestamp(), true); |
@@ -148,4 +177,84 @@ TEST(SortOrderTest, Satisfies) { |
148 | 177 | EXPECT_FALSE(sort_order2.Satisfies(sort_order4)); |
149 | 178 | } |
150 | 179 |
|
| 180 | +TEST_F(SortOrderMakeTest, MakeValidSortOrder) { |
| 181 | + ICEBERG_UNWRAP_OR_FAIL( |
| 182 | + auto sort_order, |
| 183 | + SortOrder::Make(*schema_, 1, std::vector<SortField>{*sort_field1_, *sort_field2_})); |
| 184 | + ASSERT_NE(sort_order, nullptr); |
| 185 | + |
| 186 | + EXPECT_TRUE(sort_order->is_sorted()); |
| 187 | + ASSERT_EQ(sort_order->fields().size(), 2); |
| 188 | + EXPECT_EQ(sort_order->fields()[0], *sort_field1_); |
| 189 | + EXPECT_EQ(sort_order->fields()[1], *sort_field2_); |
| 190 | +} |
| 191 | + |
| 192 | +TEST_F(SortOrderMakeTest, MakeInvalidSortOrderEmptyFields) { |
| 193 | + auto sort_order = SortOrder::Make(*schema_, 1, std::vector<SortField>{}); |
| 194 | + EXPECT_THAT(sort_order, IsError(ErrorKind::kInvalidArgument)); |
| 195 | + EXPECT_THAT(sort_order, |
| 196 | + HasErrorMessage("Sort order must have at least one sort field")); |
| 197 | +} |
| 198 | + |
| 199 | +TEST_F(SortOrderMakeTest, MakeInvalidSortOrderUnsortedId) { |
| 200 | + auto sort_order = SortOrder::Make(*schema_, SortOrder::kUnsortedOrderId, |
| 201 | + std::vector<SortField>{*sort_field1_}); |
| 202 | + EXPECT_THAT(sort_order, IsError(ErrorKind::kInvalidArgument)); |
| 203 | + EXPECT_THAT(sort_order, |
| 204 | + HasErrorMessage(std::format("{} is reserved for unsorted sort order", |
| 205 | + SortOrder::kUnsortedOrderId))); |
| 206 | +} |
| 207 | + |
| 208 | +TEST_F(SortOrderMakeTest, MakeValidUnsortedSortOrder) { |
| 209 | + ICEBERG_UNWRAP_OR_FAIL(auto sort_order, SortOrder::Make(SortOrder::kUnsortedOrderId, |
| 210 | + std::vector<SortField>{})); |
| 211 | + ASSERT_NE(sort_order, nullptr); |
| 212 | + |
| 213 | + EXPECT_TRUE(sort_order->is_unsorted()); |
| 214 | + EXPECT_EQ(sort_order->fields().size(), 0); |
| 215 | +} |
| 216 | + |
| 217 | +TEST_F(SortOrderMakeTest, MakeInvalidSortOrderNonPrimitiveField) { |
| 218 | + auto struct_field = std::make_unique<SchemaField>( |
| 219 | + 4, "struct_field", |
| 220 | + std::make_shared<StructType>(std::vector<SchemaField>{ |
| 221 | + SchemaField::MakeRequired(41, "inner_field", iceberg::int32()), |
| 222 | + }), |
| 223 | + true); |
| 224 | + |
| 225 | + Schema schema_with_struct( |
| 226 | + std::vector<SchemaField>{*field1_, *field2_, *field3_, *struct_field}, 1); |
| 227 | + |
| 228 | + SortField sort_field_invalid(4, Transform::Identity(), SortDirection::kAscending, |
| 229 | + NullOrder::kFirst); |
| 230 | + |
| 231 | + auto sort_order = SortOrder::Make( |
| 232 | + schema_with_struct, 1, std::vector<SortField>{*sort_field1_, sort_field_invalid}); |
| 233 | + EXPECT_THAT(sort_order, IsError(ErrorKind::kInvalidArgument)); |
| 234 | + EXPECT_THAT(sort_order, HasErrorMessage("Invalid source type")); |
| 235 | +} |
| 236 | + |
| 237 | +TEST_F(SortOrderMakeTest, MakeInvalidSortOrderFieldNotInSchema) { |
| 238 | + SortField sort_field_invalid(999, Transform::Identity(), SortDirection::kAscending, |
| 239 | + NullOrder::kFirst); |
| 240 | + |
| 241 | + auto sort_order = SortOrder::Make( |
| 242 | + *schema_, 1, std::vector<SortField>{*sort_field1_, sort_field_invalid}); |
| 243 | + EXPECT_THAT(sort_order, IsError(ErrorKind::kInvalidArgument)); |
| 244 | + EXPECT_THAT(sort_order, HasErrorMessage("Cannot find source column for sort field")); |
| 245 | +} |
| 246 | + |
| 247 | +TEST_F(SortOrderMakeTest, MakeUnboundSortOrder) { |
| 248 | + SortField sort_field_invalid(999, Transform::Identity(), SortDirection::kAscending, |
| 249 | + NullOrder::kFirst); |
| 250 | + |
| 251 | + auto sort_order = |
| 252 | + SortOrder::Make(1, std::vector<SortField>{*sort_field1_, sort_field_invalid}); |
| 253 | + ASSERT_THAT(sort_order, IsOk()); |
| 254 | + auto validate_status = sort_order.value()->Validate(*schema_); |
| 255 | + EXPECT_THAT(validate_status, IsError(ErrorKind::kInvalidArgument)); |
| 256 | + EXPECT_THAT(validate_status, |
| 257 | + HasErrorMessage("Cannot find source column for sort field")); |
| 258 | +} |
| 259 | + |
151 | 260 | } // namespace iceberg |
0 commit comments