1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
//! Transforms in iceberg.
use std::fmt::{Display, Formatter};
use std::str::FromStr;
use fnv::FnvHashSet;
use serde::{Deserialize, Deserializer, Serialize, Serializer};
use super::{Datum, PrimitiveLiteral};
use crate::error::{Error, Result};
use crate::expr::{
BinaryExpression, BoundPredicate, BoundReference, Predicate, PredicateOperator, Reference,
SetExpression, UnaryExpression,
};
use crate::spec::datatypes::{PrimitiveType, Type};
use crate::transform::{create_transform_function, BoxedTransformFunction};
use crate::ErrorKind;
/// Transform is used to transform predicates to partition predicates,
/// in addition to transforming data values.
///
/// Deriving partition predicates from column predicates on the table data
/// is used to separate the logical queries from physical storage: the
/// partitioning can change and the correct partition filters are always
/// derived from column predicates.
///
/// This simplifies queries because users don’t have to supply both logical
/// predicates and partition predicates.
///
/// All transforms must return `null` for a `null` input value.
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
pub enum Transform {
/// Source value, unmodified
///
/// - Source type could be any type.
/// - Return type is the same with source type.
Identity,
/// Hash of value, mod `N`.
///
/// Bucket partition transforms use a 32-bit hash of the source value.
/// The 32-bit hash implementation is the 32-bit Murmur3 hash, x86
/// variant, seeded with 0.
///
/// Transforms are parameterized by a number of buckets, N. The hash mod
/// N must produce a positive value by first discarding the sign bit of
/// the hash value. In pseudo-code, the function is:
///
/// ```text
/// def bucket_N(x) = (murmur3_x86_32_hash(x) & Integer.MAX_VALUE) % N
/// ```
///
/// - Source type could be `int`, `long`, `decimal`, `date`, `time`,
/// `timestamp`, `timestamptz`, `string`, `uuid`, `fixed`, `binary`.
/// - Return type is `int`.
Bucket(u32),
/// Value truncated to width `W`
///
/// For `int`:
///
/// - `v - (v % W)` remainders must be positive
/// - example: W=10: 1 → 0, -1 → -10
/// - note: The remainder, v % W, must be positive.
///
/// For `long`:
///
/// - `v - (v % W)` remainders must be positive
/// - example: W=10: 1 → 0, -1 → -10
/// - note: The remainder, v % W, must be positive.
///
/// For `decimal`:
///
/// - `scaled_W = decimal(W, scale(v)) v - (v % scaled_W)`
/// - example: W=50, s=2: 10.65 → 10.50
///
/// For `string`:
///
/// - Substring of length L: `v.substring(0, L)`
/// - example: L=3: iceberg → ice
/// - note: Strings are truncated to a valid UTF-8 string with no more
/// than L code points.
///
/// - Source type could be `int`, `long`, `decimal`, `string`
/// - Return type is the same with source type.
Truncate(u32),
/// Extract a date or timestamp year, as years from 1970
///
/// - Source type could be `date`, `timestamp`, `timestamptz`
/// - Return type is `int`
Year,
/// Extract a date or timestamp month, as months from 1970-01-01
///
/// - Source type could be `date`, `timestamp`, `timestamptz`
/// - Return type is `int`
Month,
/// Extract a date or timestamp day, as days from 1970-01-01
///
/// - Source type could be `date`, `timestamp`, `timestamptz`
/// - Return type is `int`
Day,
/// Extract a timestamp hour, as hours from 1970-01-01 00:00:00
///
/// - Source type could be `timestamp`, `timestamptz`
/// - Return type is `int`
Hour,
/// Always produces `null`
///
/// The void transform may be used to replace the transform in an
/// existing partition field so that the field is effectively dropped in
/// v1 tables.
///
/// - Source type could be any type..
/// - Return type is Source type.
Void,
/// Used to represent some customized transform that can't be recognized or supported now.
Unknown,
}
impl Transform {
/// Get the return type of transform given the input type.
/// Returns `None` if it can't be transformed.
pub fn result_type(&self, input_type: &Type) -> Result<Type> {
match self {
Transform::Identity => {
if matches!(input_type, Type::Primitive(_)) {
Ok(input_type.clone())
} else {
Err(Error::new(
ErrorKind::DataInvalid,
format!("{input_type} is not a valid input type of identity transform",),
))
}
}
Transform::Void => Ok(input_type.clone()),
Transform::Unknown => Ok(Type::Primitive(PrimitiveType::String)),
Transform::Bucket(_) => {
if let Type::Primitive(p) = input_type {
match p {
PrimitiveType::Int
| PrimitiveType::Long
| PrimitiveType::Decimal { .. }
| PrimitiveType::Date
| PrimitiveType::Time
| PrimitiveType::Timestamp
| PrimitiveType::Timestamptz
| PrimitiveType::TimestampNs
| PrimitiveType::TimestamptzNs
| PrimitiveType::String
| PrimitiveType::Uuid
| PrimitiveType::Fixed(_)
| PrimitiveType::Binary => Ok(Type::Primitive(PrimitiveType::Int)),
_ => Err(Error::new(
ErrorKind::DataInvalid,
format!("{input_type} is not a valid input type of bucket transform",),
)),
}
} else {
Err(Error::new(
ErrorKind::DataInvalid,
format!("{input_type} is not a valid input type of bucket transform",),
))
}
}
Transform::Truncate(_) => {
if let Type::Primitive(p) = input_type {
match p {
PrimitiveType::Int
| PrimitiveType::Long
| PrimitiveType::String
| PrimitiveType::Binary
| PrimitiveType::Decimal { .. } => Ok(input_type.clone()),
_ => Err(Error::new(
ErrorKind::DataInvalid,
format!("{input_type} is not a valid input type of truncate transform",),
)),
}
} else {
Err(Error::new(
ErrorKind::DataInvalid,
format!("{input_type} is not a valid input type of truncate transform",),
))
}
}
Transform::Year | Transform::Month | Transform::Day => {
if let Type::Primitive(p) = input_type {
match p {
PrimitiveType::Timestamp
| PrimitiveType::Timestamptz
| PrimitiveType::TimestampNs
| PrimitiveType::TimestamptzNs
| PrimitiveType::Date => Ok(Type::Primitive(PrimitiveType::Date)),
_ => Err(Error::new(
ErrorKind::DataInvalid,
format!("{input_type} is not a valid input type of {self} transform",),
)),
}
} else {
Err(Error::new(
ErrorKind::DataInvalid,
format!("{input_type} is not a valid input type of {self} transform",),
))
}
}
Transform::Hour => {
if let Type::Primitive(p) = input_type {
match p {
PrimitiveType::Timestamp
| PrimitiveType::Timestamptz
| PrimitiveType::TimestampNs
| PrimitiveType::TimestamptzNs => Ok(Type::Primitive(PrimitiveType::Int)),
_ => Err(Error::new(
ErrorKind::DataInvalid,
format!("{input_type} is not a valid input type of {self} transform",),
)),
}
} else {
Err(Error::new(
ErrorKind::DataInvalid,
format!("{input_type} is not a valid input type of {self} transform",),
))
}
}
}
}
/// Whether the transform preserves the order of values.
pub fn preserves_order(&self) -> bool {
!matches!(
self,
Transform::Void | Transform::Bucket(_) | Transform::Unknown
)
}
/// Return the unique transform name to check if similar transforms for the same source field
/// are added multiple times in partition spec builder.
pub fn dedup_name(&self) -> String {
match self {
Transform::Year | Transform::Month | Transform::Day | Transform::Hour => {
"time".to_string()
}
_ => format!("{self}"),
}
}
/// Whether ordering by this transform's result satisfies the ordering of another transform's
/// result.
///
/// For example, sorting by day(ts) will produce an ordering that is also by month(ts) or
/// year(ts). However, sorting by day(ts) will not satisfy the order of hour(ts) or identity(ts).
pub fn satisfies_order_of(&self, other: &Self) -> bool {
match self {
Transform::Identity => other.preserves_order(),
Transform::Hour => matches!(
other,
Transform::Hour | Transform::Day | Transform::Month | Transform::Year
),
Transform::Day => matches!(other, Transform::Day | Transform::Month | Transform::Year),
Transform::Month => matches!(other, Transform::Month | Transform::Year),
_ => self == other,
}
}
/// Projects a given predicate according to the transformation
/// specified by the `Transform` instance.
///
/// This allows predicates to be effectively applied to data
/// that has undergone transformation, enabling efficient querying
/// and filtering based on the original, untransformed data.
///
/// # Example
/// Suppose, we have row filter `a = 10`, and a partition spec
/// `bucket(a, 37) as bs`, if one row matches `a = 10`, then its partition
/// value should match `bucket(10, 37) as bs`, and we project `a = 10` to
/// `bs = bucket(10, 37)`
pub fn project(&self, name: &str, predicate: &BoundPredicate) -> Result<Option<Predicate>> {
let func = create_transform_function(self)?;
match self {
Transform::Identity => match predicate {
BoundPredicate::Unary(expr) => Self::project_unary(expr.op(), name),
BoundPredicate::Binary(expr) => Ok(Some(Predicate::Binary(BinaryExpression::new(
expr.op(),
Reference::new(name),
expr.literal().to_owned(),
)))),
BoundPredicate::Set(expr) => Ok(Some(Predicate::Set(SetExpression::new(
expr.op(),
Reference::new(name),
expr.literals().to_owned(),
)))),
_ => Ok(None),
},
Transform::Bucket(_) => match predicate {
BoundPredicate::Unary(expr) => Self::project_unary(expr.op(), name),
BoundPredicate::Binary(expr) => self.project_eq_operator(name, expr, &func),
BoundPredicate::Set(expr) => self.project_in_operator(expr, name, &func),
_ => Ok(None),
},
Transform::Truncate(width) => match predicate {
BoundPredicate::Unary(expr) => Self::project_unary(expr.op(), name),
BoundPredicate::Binary(expr) => {
self.project_binary_with_adjusted_boundary(name, expr, &func, Some(*width))
}
BoundPredicate::Set(expr) => self.project_in_operator(expr, name, &func),
_ => Ok(None),
},
Transform::Year | Transform::Month | Transform::Day | Transform::Hour => {
match predicate {
BoundPredicate::Unary(expr) => Self::project_unary(expr.op(), name),
BoundPredicate::Binary(expr) => {
self.project_binary_with_adjusted_boundary(name, expr, &func, None)
}
BoundPredicate::Set(expr) => self.project_in_operator(expr, name, &func),
_ => Ok(None),
}
}
_ => Ok(None),
}
}
/// Check if `Transform` is applicable on datum's `PrimitiveType`
fn can_transform(&self, datum: &Datum) -> bool {
let input_type = datum.data_type().clone();
self.result_type(&Type::Primitive(input_type)).is_ok()
}
/// Creates a unary predicate from a given operator and a reference name.
fn project_unary(op: PredicateOperator, name: &str) -> Result<Option<Predicate>> {
Ok(Some(Predicate::Unary(UnaryExpression::new(
op,
Reference::new(name),
))))
}
/// Attempts to create a binary predicate based on a binary expression,
/// if applicable.
///
/// This method evaluates a given binary expression and, if the operation
/// is equality (`Eq`) and the literal can be transformed, constructs a
/// `Predicate::Binary`variant representing the binary operation.
fn project_eq_operator(
&self,
name: &str,
expr: &BinaryExpression<BoundReference>,
func: &BoxedTransformFunction,
) -> Result<Option<Predicate>> {
if expr.op() != PredicateOperator::Eq || !self.can_transform(expr.literal()) {
return Ok(None);
}
Ok(Some(Predicate::Binary(BinaryExpression::new(
expr.op(),
Reference::new(name),
func.transform_literal_result(expr.literal())?,
))))
}
/// Projects a binary expression to a predicate with an adjusted boundary.
///
/// Checks if the literal within the given binary expression is
/// transformable. If transformable, it proceeds to potentially adjust
/// the boundary of the expression based on the comparison operator (`op`).
/// The potential adjustments involve incrementing or decrementing the
/// literal value and changing the `PredicateOperator` itself to its
/// inclusive variant.
fn project_binary_with_adjusted_boundary(
&self,
name: &str,
expr: &BinaryExpression<BoundReference>,
func: &BoxedTransformFunction,
width: Option<u32>,
) -> Result<Option<Predicate>> {
if !self.can_transform(expr.literal()) {
return Ok(None);
}
let op = &expr.op();
let datum = &expr.literal();
if let Some(boundary) = Self::adjust_boundary(op, datum)? {
let transformed_projection = func.transform_literal_result(&boundary)?;
let adjusted_projection =
self.adjust_time_projection(op, datum, &transformed_projection);
let adjusted_operator = Self::adjust_operator(op, datum, width);
if let Some(op) = adjusted_operator {
let predicate = match adjusted_projection {
None => Predicate::Binary(BinaryExpression::new(
op,
Reference::new(name),
transformed_projection,
)),
Some(AdjustedProjection::Single(d)) => {
Predicate::Binary(BinaryExpression::new(op, Reference::new(name), d))
}
Some(AdjustedProjection::Set(d)) => Predicate::Set(SetExpression::new(
PredicateOperator::In,
Reference::new(name),
d,
)),
};
return Ok(Some(predicate));
}
};
Ok(None)
}
/// Projects a set expression to a predicate,
/// applying a transformation to each literal in the set.
fn project_in_operator(
&self,
expr: &SetExpression<BoundReference>,
name: &str,
func: &BoxedTransformFunction,
) -> Result<Option<Predicate>> {
if expr.op() != PredicateOperator::In
|| expr.literals().iter().any(|d| !self.can_transform(d))
{
return Ok(None);
}
let mut new_set = FnvHashSet::default();
for lit in expr.literals() {
let datum = func.transform_literal_result(lit)?;
if let Some(AdjustedProjection::Single(d)) =
self.adjust_time_projection(&PredicateOperator::In, lit, &datum)
{
new_set.insert(d);
};
new_set.insert(datum);
}
Ok(Some(Predicate::Set(SetExpression::new(
expr.op(),
Reference::new(name),
new_set,
))))
}
/// Adjusts the boundary value for comparison operations
/// based on the specified `PredicateOperator` and `Datum`.
///
/// This function modifies the boundary value for certain comparison
/// operators (`LessThan`, `GreaterThan`) by incrementing or decrementing
/// the literal value within the given `Datum`. For operators that do not
/// imply a boundary shift (`Eq`, `LessThanOrEq`, `GreaterThanOrEq`,
/// `StartsWith`, `NotStartsWith`), the original datum is returned
/// unmodified.
fn adjust_boundary(op: &PredicateOperator, datum: &Datum) -> Result<Option<Datum>> {
let adjusted_boundary = match op {
PredicateOperator::LessThan => match (datum.data_type(), datum.literal()) {
(PrimitiveType::Int, PrimitiveLiteral::Int(v)) => Some(Datum::int(v - 1)),
(PrimitiveType::Long, PrimitiveLiteral::Long(v)) => Some(Datum::long(v - 1)),
(PrimitiveType::Decimal { .. }, PrimitiveLiteral::Int128(v)) => {
Some(Datum::decimal(v - 1)?)
}
(PrimitiveType::Date, PrimitiveLiteral::Int(v)) => Some(Datum::date(v - 1)),
(PrimitiveType::Timestamp, PrimitiveLiteral::Long(v)) => {
Some(Datum::timestamp_micros(v - 1))
}
_ => Some(datum.to_owned()),
},
PredicateOperator::GreaterThan => match (datum.data_type(), datum.literal()) {
(PrimitiveType::Int, PrimitiveLiteral::Int(v)) => Some(Datum::int(v + 1)),
(PrimitiveType::Long, PrimitiveLiteral::Long(v)) => Some(Datum::long(v + 1)),
(PrimitiveType::Decimal { .. }, PrimitiveLiteral::Int128(v)) => {
Some(Datum::decimal(v + 1)?)
}
(PrimitiveType::Date, PrimitiveLiteral::Int(v)) => Some(Datum::date(v + 1)),
(PrimitiveType::Timestamp, PrimitiveLiteral::Long(v)) => {
Some(Datum::timestamp_micros(v + 1))
}
_ => Some(datum.to_owned()),
},
PredicateOperator::Eq
| PredicateOperator::LessThanOrEq
| PredicateOperator::GreaterThanOrEq
| PredicateOperator::StartsWith
| PredicateOperator::NotStartsWith => Some(datum.to_owned()),
_ => None,
};
Ok(adjusted_boundary)
}
/// Adjusts the comparison operator based on the specified datum and an
/// optional width constraint.
///
/// This function modifies the comparison operator for `LessThan` and
/// `GreaterThan` cases to their inclusive counterparts (`LessThanOrEq`,
/// `GreaterThanOrEq`) unconditionally. For `StartsWith` and
/// `NotStartsWith` operators acting on string literals, the operator may
/// be adjusted to `Eq` or `NotEq` if the string length matches the
/// specified width, indicating a precise match rather than a prefix
/// condition.
fn adjust_operator(
op: &PredicateOperator,
datum: &Datum,
width: Option<u32>,
) -> Option<PredicateOperator> {
match op {
PredicateOperator::LessThan => Some(PredicateOperator::LessThanOrEq),
PredicateOperator::GreaterThan => Some(PredicateOperator::GreaterThanOrEq),
PredicateOperator::StartsWith => match datum.literal() {
PrimitiveLiteral::String(s) => {
if let Some(w) = width {
if s.len() == w as usize {
return Some(PredicateOperator::Eq);
};
};
Some(*op)
}
_ => Some(*op),
},
PredicateOperator::NotStartsWith => match datum.literal() {
PrimitiveLiteral::String(s) => {
if let Some(w) = width {
let w = w as usize;
if s.len() == w {
return Some(PredicateOperator::NotEq);
}
if s.len() < w {
return Some(*op);
}
return None;
};
Some(*op)
}
_ => Some(*op),
},
_ => Some(*op),
}
}
/// Adjust projection for temporal transforms, align with Java
/// implementation: https://github.com/apache/iceberg/blob/main/api/src/main/java/org/apache/iceberg/transforms/ProjectionUtil.java#L275
fn adjust_time_projection(
&self,
op: &PredicateOperator,
original: &Datum,
transformed: &Datum,
) -> Option<AdjustedProjection> {
let should_adjust = match self {
Transform::Day => matches!(original.data_type(), PrimitiveType::Timestamp),
Transform::Year | Transform::Month => true,
_ => false,
};
if should_adjust {
if let &PrimitiveLiteral::Int(v) = transformed.literal() {
match op {
PredicateOperator::LessThan
| PredicateOperator::LessThanOrEq
| PredicateOperator::In => {
if v < 0 {
return Some(AdjustedProjection::Single(Datum::int(v + 1)));
};
}
PredicateOperator::Eq => {
if v < 0 {
let new_set = FnvHashSet::from_iter(vec![
transformed.to_owned(),
Datum::int(v + 1),
]);
return Some(AdjustedProjection::Set(new_set));
}
}
_ => {
return None;
}
}
};
}
None
}
}
impl Display for Transform {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
match self {
Transform::Identity => write!(f, "identity"),
Transform::Year => write!(f, "year"),
Transform::Month => write!(f, "month"),
Transform::Day => write!(f, "day"),
Transform::Hour => write!(f, "hour"),
Transform::Void => write!(f, "void"),
Transform::Bucket(length) => write!(f, "bucket[{length}]"),
Transform::Truncate(width) => write!(f, "truncate[{width}]"),
Transform::Unknown => write!(f, "unknown"),
}
}
}
impl FromStr for Transform {
type Err = Error;
fn from_str(s: &str) -> Result<Self> {
let t = match s {
"identity" => Transform::Identity,
"year" => Transform::Year,
"month" => Transform::Month,
"day" => Transform::Day,
"hour" => Transform::Hour,
"void" => Transform::Void,
"unknown" => Transform::Unknown,
v if v.starts_with("bucket") => {
let length = v
.strip_prefix("bucket")
.expect("transform must starts with `bucket`")
.trim_start_matches('[')
.trim_end_matches(']')
.parse()
.map_err(|err| {
Error::new(
ErrorKind::DataInvalid,
format!("transform bucket type {v:?} is invalid"),
)
.with_source(err)
})?;
Transform::Bucket(length)
}
v if v.starts_with("truncate") => {
let width = v
.strip_prefix("truncate")
.expect("transform must starts with `truncate`")
.trim_start_matches('[')
.trim_end_matches(']')
.parse()
.map_err(|err| {
Error::new(
ErrorKind::DataInvalid,
format!("transform truncate type {v:?} is invalid"),
)
.with_source(err)
})?;
Transform::Truncate(width)
}
v => {
return Err(Error::new(
ErrorKind::DataInvalid,
format!("transform {v:?} is invalid"),
))
}
};
Ok(t)
}
}
impl Serialize for Transform {
fn serialize<S>(&self, serializer: S) -> std::result::Result<S::Ok, S::Error>
where S: Serializer {
serializer.serialize_str(format!("{self}").as_str())
}
}
impl<'de> Deserialize<'de> for Transform {
fn deserialize<D>(deserializer: D) -> std::result::Result<Self, D::Error>
where D: Deserializer<'de> {
let s = String::deserialize(deserializer)?;
s.parse().map_err(<D::Error as serde::de::Error>::custom)
}
}
/// An enum representing the result of the adjusted projection.
/// Either being a single adjusted datum or a set.
#[derive(Debug)]
enum AdjustedProjection {
Single(Datum),
Set(FnvHashSet<Datum>),
}