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 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762
use super::graphql::GraphqlError;
use fuel_indexer_database::DbType;
use fuel_indexer_schema::db::tables::IndexerSchema;
use async_graphql_value::{indexmap::IndexMap, Name, Value};
use std::fmt;
/// Represents the full set of parameters that can be applied to a query.
#[derive(Debug, Clone, PartialEq, Eq, Default)]
pub struct QueryParams {
pub filters: Vec<Filter>,
pub sorts: Vec<Sort>,
pub offset: Option<u64>,
pub limit: Option<u64>,
}
impl QueryParams {
/// Iterate through the list of parsed parameters and add them to the corresponding field.
pub(crate) fn add_params(
&mut self,
params: Vec<ParamType>,
fully_qualified_table_name: String,
) {
for param in params {
match param {
ParamType::Filter(f) => self.filters.push(Filter {
fully_qualified_table_name: fully_qualified_table_name.clone(),
filter_type: f,
}),
ParamType::Sort(field, order) => self.sorts.push(Sort {
fully_qualified_table_name: format!(
"{}.{}",
fully_qualified_table_name, field
),
order,
}),
ParamType::Offset(n) => self.offset = Some(n),
ParamType::Limit(n) => self.limit = Some(n),
}
}
}
/// Return a string comprised of the query's filtering clauses, if any.
pub(crate) fn get_filtering_expression(&self, db_type: &DbType) -> String {
let mut query_clause = "".to_string();
if !self.filters.is_empty() {
let where_expressions = self
.filters
.iter()
.map(|f| f.to_sql(db_type))
.collect::<Vec<String>>()
.join(" AND ");
query_clause =
["WHERE".to_string(), query_clause, where_expressions].join(" ");
}
query_clause
}
/// Return a string comprised of modifiers to the order of the result set, if any.
pub(crate) fn get_ordering_modififer(&self, db_type: &DbType) -> String {
let mut query_clause = "".to_string();
match db_type {
DbType::Postgres => {
if !self.sorts.is_empty() {
let sort_expressions = self
.sorts
.iter()
.map(|s| format!("{} {}", s.fully_qualified_table_name, s.order))
.collect::<Vec<String>>()
.join(", ");
query_clause =
[query_clause, "ORDER BY".to_string(), sort_expressions]
.join(" ");
}
}
}
query_clause
}
}
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct Filter {
pub fully_qualified_table_name: String,
pub filter_type: FilterType,
}
impl Filter {
pub fn to_sql(&self, db_type: &DbType) -> String {
self.filter_type
.to_sql(self.fully_qualified_table_name.clone(), db_type)
}
}
/// Represents the different types of parameters that can be created.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum ParamType {
Filter(FilterType),
Sort(String, SortOrder),
Offset(u64),
Limit(u64),
}
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct Sort {
pub fully_qualified_table_name: String,
pub order: SortOrder,
}
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum SortOrder {
Asc,
Desc,
}
impl fmt::Display for SortOrder {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
match self {
SortOrder::Asc => write!(f, "ASC"),
SortOrder::Desc => write!(f, "DESC"),
}
}
}
/// Represents the possible value types that the indexer's GraphQL API supports.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum ParsedValue {
BigNumber(u128),
Number(u64),
String(String),
Boolean(bool),
}
/// Display trait implementation, mainly to be able to use `.to_string()`.
///
/// Databases may support several value types in a filtering clause, e.g.
/// one can check equality against a number or a string. As such, the
/// `.to_string()` method for each type returns the value in the requisite format.
impl fmt::Display for ParsedValue {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
match self {
Self::BigNumber(bn) => {
write!(f, "{bn}")
}
Self::Boolean(b) => {
write!(f, "{b}")
}
Self::Number(n) => {
write!(f, "{n}")
}
Self::String(s) => {
write!(f, "\'{s}\'")
}
}
}
}
/// Represents an operation through which records can be included or excluded.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum FilterType {
IdSelection(ParsedValue),
Comparison(Comparison),
Membership(Membership),
NullValueCheck(NullValueCheck),
LogicOp(LogicOp),
}
/// Represents an operation in which a record is compared against a particular value.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum Comparison {
Between(String, ParsedValue, ParsedValue),
Greater(String, ParsedValue),
GreaterEqual(String, ParsedValue),
Less(String, ParsedValue),
LessEqual(String, ParsedValue),
Equals(String, ParsedValue),
NotEquals(String, ParsedValue),
}
/// Represents an operation in which a record's column value is checked for membership in a set.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum Membership {
In(String, Vec<ParsedValue>),
NotIn(String, Vec<ParsedValue>),
}
/// Represents an operation in which records are filtered by the presence of null values or lack thereof.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum NullValueCheck {
NoNulls(Vec<String>),
OnlyNulls(Vec<String>),
}
/// Represents an operation in which filters are associated with one another and evaluated together.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum LogicOp {
And(Box<FilterType>, Box<FilterType>),
Or(Box<FilterType>, Box<FilterType>),
Not(Box<FilterType>),
}
impl FilterType {
/// Returns a string to be used as part of a SQL database query.
pub fn to_sql(&self, fully_qualified_table: String, db_type: &DbType) -> String {
match db_type {
DbType::Postgres => match self {
Self::Comparison(c) => match c {
Comparison::Between(field, min, max) => {
format!("{fully_qualified_table}.{field} BETWEEN {min} AND {max}",)
}
Comparison::Equals(field, val) => {
format!("{fully_qualified_table}.{field} = {val}",)
}
Comparison::NotEquals(field, val) => {
format!("{fully_qualified_table}.{field} <> {val}",)
}
Comparison::Greater(field, val) => {
format!("{fully_qualified_table}.{field} > {val}",)
}
Comparison::GreaterEqual(field, val) => {
format!("{fully_qualified_table}.{field} >= {val}",)
}
Comparison::Less(field, val) => {
format!("{fully_qualified_table}.{field} < {val}",)
}
Comparison::LessEqual(field, val) => {
format!("{fully_qualified_table}.{field} <= {val}",)
}
},
Self::IdSelection(id) => {
format!("{fully_qualified_table}.id = {id}")
}
Self::LogicOp(lo) => match lo {
LogicOp::And(r1, r2) => format!(
"({} AND {})",
r1.to_sql(fully_qualified_table.clone(), db_type),
r2.to_sql(fully_qualified_table, db_type)
),
LogicOp::Or(r1, r2) => format!(
"({} OR {})",
r1.to_sql(fully_qualified_table.clone(), db_type),
r2.to_sql(fully_qualified_table, db_type)
),
// The NOT logical operator does not get turned into a string as
// it will have already been used to transform a filter into its
// inverse equivalent.
_ => "".to_string(),
},
Self::Membership(m) => match m {
Membership::In(field, member_set) => {
format!(
"{fully_qualified_table}.{field} IN ({})",
member_set
.iter()
.map(|v| v.to_string())
.collect::<Vec<String>>()
.join(", ")
)
}
Membership::NotIn(field, member_set) => {
format!(
"{fully_qualified_table}.{field} NOT IN ({})",
member_set
.iter()
.map(|v| v.to_string())
.collect::<Vec<String>>()
.join(", ")
)
}
},
Self::NullValueCheck(nvc) => match nvc {
NullValueCheck::NoNulls(column_list) => {
return column_list
.iter()
.map(|col| {
format!("{fully_qualified_table}.{col} IS NOT NULL")
})
.collect::<Vec<String>>()
.join(" AND ");
}
NullValueCheck::OnlyNulls(column_list) => {
return column_list
.iter()
.map(|col| format!("{fully_qualified_table}.{col} IS NULL"))
.collect::<Vec<String>>()
.join(" AND ");
}
},
},
}
}
}
impl FilterType {
/// Invert a filter into its opposite filter.
///
/// Each filter should have a inverse type when inverted in order to minimize
/// disruption to the user. When adding a new filter type, special consideration
/// should be given as to if and how it can be represented in the inverse.
fn invert(&self) -> Result<FilterType, GraphqlError> {
match self {
FilterType::IdSelection(_) => Err(GraphqlError::UnsupportedNegation(
"ID selection".to_string(),
)),
FilterType::Comparison(c) => match c {
Comparison::Between(field, val1, val2) => {
Ok(FilterType::LogicOp(LogicOp::And(
Box::new(FilterType::Comparison(Comparison::Less(
field.clone(),
val1.clone(),
))),
Box::new(FilterType::Comparison(Comparison::Greater(
field.clone(),
val2.clone(),
))),
)))
}
Comparison::Greater(field, val) => Ok(FilterType::Comparison(
Comparison::LessEqual(field.clone(), val.clone()),
)),
Comparison::GreaterEqual(field, val) => Ok(FilterType::Comparison(
Comparison::Less(field.clone(), val.clone()),
)),
Comparison::Less(field, val) => Ok(FilterType::Comparison(
Comparison::GreaterEqual(field.clone(), val.clone()),
)),
Comparison::LessEqual(field, val) => Ok(FilterType::Comparison(
Comparison::Greater(field.clone(), val.clone()),
)),
Comparison::Equals(field, val) => Ok(FilterType::Comparison(
Comparison::NotEquals(field.clone(), val.clone()),
)),
Comparison::NotEquals(field, val) => Ok(FilterType::Comparison(
Comparison::Equals(field.clone(), val.clone()),
)),
},
FilterType::Membership(mf) => match mf {
Membership::In(field, element_list) => Ok(FilterType::Membership(
Membership::NotIn(field.clone(), element_list.clone()),
)),
Membership::NotIn(field, element_list) => Ok(FilterType::Membership(
Membership::In(field.clone(), element_list.clone()),
)),
},
FilterType::NullValueCheck(nvc) => match nvc {
NullValueCheck::NoNulls(column_list) => Ok(FilterType::NullValueCheck(
NullValueCheck::OnlyNulls(column_list.clone()),
)),
NullValueCheck::OnlyNulls(column_list) => Ok(FilterType::NullValueCheck(
NullValueCheck::NoNulls(column_list.clone()),
)),
},
FilterType::LogicOp(lo) => match lo {
LogicOp::And(r1, r2) => Ok(FilterType::LogicOp(LogicOp::And(
Box::new(r1.clone().invert()?),
Box::new(r2.clone().invert()?),
))),
LogicOp::Or(r1, r2) => Ok(FilterType::LogicOp(LogicOp::Or(
Box::new(r1.clone().invert()?),
Box::new(r2.clone().invert()?),
))),
LogicOp::Not(f) => Ok(*f.clone()),
},
}
}
}
/// Parse an argument key-value pair into a `Filter`.
///
/// `parse_arguments` is the entry point for parsing all API query arguments.
/// Any new top-level operators should first be added here.
pub fn parse_argument_into_param(
entity_type: Option<&String>,
arg: &str,
value: Value,
schema: &IndexerSchema,
) -> Result<ParamType, GraphqlError> {
match arg {
"filter" => {
// We instantiate an Option<Filter> in order to keep track of the last
// seen filter in the event that an AND/OR operator is used; if so, the
// prior filter is associated with the inner filter of the logical operator.
let mut prior_filter: Option<FilterType> = None;
if let Value::Object(obj) = value {
let filter =
parse_filter_object(obj, entity_type, schema, &mut prior_filter)?;
Ok(ParamType::Filter(filter))
} else {
Err(GraphqlError::UnsupportedValueType(value.to_string()))
}
}
"id" => Ok(ParamType::Filter(FilterType::IdSelection(parse_value(
&value,
)?))),
"order" => {
if let Value::Object(obj) = value {
if let Some((field, sort_order)) = obj.into_iter().next() {
if schema
.parsed()
.graphql_type(entity_type, field.as_str())
.is_some()
{
if let Value::Enum(sort_order) = sort_order {
match sort_order.as_str() {
"asc" => {
return Ok(ParamType::Sort(
field.to_string(),
SortOrder::Asc,
))
}
"desc" => {
return Ok(ParamType::Sort(
field.to_string(),
SortOrder::Desc,
))
}
other => {
return Err(GraphqlError::UnableToParseValue(
other.to_string(),
))
}
}
}
} else {
return Err(GraphqlError::UnsupportedValueType(
sort_order.to_string(),
));
}
}
Err(GraphqlError::NoPredicatesInFilter)
} else {
Err(GraphqlError::UnsupportedValueType(value.to_string()))
}
}
"offset" => {
if let Value::Number(number) = value {
if let Some(offset) = number.as_u64() {
Ok(ParamType::Offset(offset))
} else {
Err(GraphqlError::UnsupportedValueType(number.to_string()))
}
} else {
Err(GraphqlError::UnsupportedValueType(value.to_string()))
}
}
"first" => {
if let Value::Number(number) = value {
if let Some(limit) = number.as_u64() {
Ok(ParamType::Limit(limit))
} else {
Err(GraphqlError::UnsupportedValueType(number.to_string()))
}
} else {
Err(GraphqlError::UnsupportedValueType(value.to_string()))
}
}
_ => {
if let Some(entity) = entity_type {
Err(GraphqlError::UnrecognizedArgument(
entity.to_string(),
arg.to_string(),
))
} else {
// Returned when using an argument at the root of query
Err(GraphqlError::UnrecognizedArgument(
"root level object".to_string(),
arg.to_string(),
))
}
}
}
}
/// Parse an object from a parsed GraphQL document into a `Filter`.
///
/// This serves as a helper function for starting the parsing operation for values under the "filter" key.
fn parse_filter_object(
obj: IndexMap<Name, Value>,
entity_type: Option<&String>,
schema: &IndexerSchema,
prior_filter: &mut Option<FilterType>,
) -> Result<FilterType, GraphqlError> {
let mut iter = obj.into_iter();
if let Some((key, predicate)) = iter.next() {
return parse_arg_pred_pair(
key.as_str(),
predicate,
entity_type,
schema,
prior_filter,
&mut iter,
);
}
Err(GraphqlError::NoPredicatesInFilter)
}
/// Parse an argument's key and value (known here as a predicate) into a `Filter`.
///
/// `parse_arg_pred_pair` contains the majority of the filter parsing functionality.
/// Any argument key that matches one of the non-field-specific filtering keywords
/// (i.e. "has" or a logical operator) is decoded accordingly. If the key does not
/// match to the aforementioned keywords but is a field of the entity type, then the
/// key and inner value are parsed into a filter.
fn parse_arg_pred_pair(
key: &str,
predicate: Value,
entity_type: Option<&String>,
schema: &IndexerSchema,
prior_filter: &mut Option<FilterType>,
top_level_arg_value_iter: &mut impl Iterator<Item = (Name, Value)>,
) -> Result<FilterType, GraphqlError> {
match key {
"has" => {
if let Value::List(elements) = predicate {
let mut column_list = vec![];
for element in elements {
if let Value::Enum(column) = element {
if schema
.parsed()
.graphql_type(entity_type, column.as_str())
.is_some()
{
column_list.push(column.to_string())
} else if let Some(entity) = entity_type {
return Err(GraphqlError::UnrecognizedField(
entity.to_string(),
column.to_string(),
));
} else {
return Err(GraphqlError::UnrecognizedType(
column.to_string(),
));
}
} else {
return Err(GraphqlError::UnsupportedValueType(
element.to_string(),
));
}
}
Ok(FilterType::NullValueCheck(NullValueCheck::NoNulls(
column_list,
)))
} else {
Err(GraphqlError::UnsupportedValueType(predicate.to_string()))
}
}
"and" | "or" => parse_binary_logical_operator(
key,
predicate.clone(),
entity_type,
schema,
top_level_arg_value_iter,
prior_filter,
),
// "NOT" is a unary logical operator, meaning that it only operates on one component.
// Thus, we attempt to parse the inner object into a filter and then transform it into
// its inverse.
"not" => {
if let Value::Object(inner_obj) = predicate {
parse_filter_object(inner_obj, entity_type, schema, prior_filter)?
.invert()
} else {
Err(GraphqlError::UnsupportedValueType(predicate.to_string()))
}
}
other => {
if schema.parsed().graphql_type(entity_type, other).is_some() {
if let Value::Object(inner_obj) = predicate {
for (key, predicate) in inner_obj.iter() {
match key.as_str() {
"between" => {
if let Value::Object(complex_comparison_obj) = predicate {
if let (Some(min), Some(max)) = (
complex_comparison_obj.get("min"),
complex_comparison_obj.get("max"),
) {
let (min, max) =
(parse_value(min)?, parse_value(max)?);
return Ok(FilterType::Comparison(
Comparison::Between(
other.to_string(),
min,
max,
),
));
}
}
}
"equals" => {
return Ok(FilterType::Comparison(Comparison::Equals(
other.to_string(),
parse_value(predicate)?,
)))
}
"gt" => {
return Ok(FilterType::Comparison(Comparison::Greater(
other.to_string(),
parse_value(predicate)?,
)))
}
"gte" => {
return Ok(FilterType::Comparison(
Comparison::GreaterEqual(
other.to_string(),
parse_value(predicate)?,
),
));
}
"lt" => {
return Ok(FilterType::Comparison(Comparison::Less(
other.to_string(),
parse_value(predicate)?,
)))
}
"lte" => {
return Ok(FilterType::Comparison(Comparison::LessEqual(
other.to_string(),
parse_value(predicate)?,
)))
}
"in" => {
if let Value::List(elements) = predicate {
let parsed_elements = elements
.iter()
.map(parse_value)
.collect::<Result<Vec<ParsedValue>,GraphqlError>>();
if let Ok(elements) = parsed_elements {
return Ok(FilterType::Membership(
Membership::In(other.to_string(), elements),
));
} else {
return Err(GraphqlError::UnableToParseValue(
predicate.to_string(),
));
}
}
}
_ => {
return Err(GraphqlError::UnsupportedFilterOperation(
key.to_string(),
))
}
}
}
Err(GraphqlError::NoPredicatesInFilter)
} else {
Err(GraphqlError::UnsupportedValueType(predicate.to_string()))
}
} else {
Err(GraphqlError::UnrecognizedType(other.to_string()))
}
}
}
}
/// Parse logical operators that operate on two components.
///
/// `parse_binary_logical_operator` is a special parsing operation that
/// essentially combines two filters into a single filter. This
/// is also where the nested filtering functionality resides.
fn parse_binary_logical_operator(
key: &str,
predicate: Value,
entity_type: Option<&String>,
schema: &IndexerSchema,
top_level_arg_value_iter: &mut impl Iterator<Item = (Name, Value)>,
prior_filter: &mut Option<FilterType>,
) -> Result<FilterType, GraphqlError> {
if let Value::Object(inner_obj) = predicate {
// Construct the filter contained in the object value for the binary logical operator
let filter = parse_filter_object(inner_obj, entity_type, schema, prior_filter)?;
// If we've already constructed a filter prior to this, associate it with
// the filter that was just parsed from the inner object.
if let Some(prior_filter) = prior_filter {
match key {
"and" => Ok(FilterType::LogicOp(LogicOp::And(
Box::new(prior_filter.clone()),
Box::new(filter),
))),
"or" => Ok(FilterType::LogicOp(LogicOp::Or(
Box::new(prior_filter.clone()),
Box::new(filter),
))),
// parse_binary_logical_operator is only called when the key is "and" or "or"
_ => unreachable!(),
}
// It's possible that we may parse a logical operator before we've constructed
// another filter; this is due to the underlying argument value type being a
// IndexMap, which sorts keys by insertion order. If so, get the next top-level
// key-object-value pair, parse it into a filter and assoicate it with the
// constructed filter from the inner object.
} else if let Some((next_key, next_predicate)) = top_level_arg_value_iter.next() {
match next_key.as_str() {
"and" | "or" => {
return parse_binary_logical_operator(
next_key.as_str(),
next_predicate,
entity_type,
schema,
top_level_arg_value_iter,
&mut Some(filter),
)
}
other => {
let next_filter = parse_arg_pred_pair(
other,
next_predicate,
entity_type,
schema,
prior_filter,
top_level_arg_value_iter,
)?;
let final_filter = match key {
"and" => FilterType::LogicOp(LogicOp::And(
Box::new(filter),
Box::new(next_filter),
)),
"or" => FilterType::LogicOp(LogicOp::Or(
Box::new(filter),
Box::new(next_filter),
)),
_ => unreachable!(),
};
return Ok(final_filter);
}
}
} else {
return Err(GraphqlError::MissingPartnerForBinaryLogicalOperator);
}
} else {
Err(GraphqlError::UnsupportedValueType(predicate.to_string()))
}
}
/// Parse a value from the parsed GraphQL document into a `ParsedValue` for use in the indexer.
///
/// Value types from the parsed GraphQL query should be turned into `ParsedValue`
/// instances so that they can be properly formatted for transformation into SQL queries.
fn parse_value(value: &Value) -> Result<ParsedValue, GraphqlError> {
match value {
// TODO: https://github.com/FuelLabs/fuel-indexer/issues/858
Value::Boolean(b) => Ok(ParsedValue::Boolean(*b)),
Value::Number(n) => {
if let Some(num) = n.as_u64() {
Ok(ParsedValue::Number(num))
} else {
Err(GraphqlError::UnableToParseValue(
"Could not parse number into u64".to_string(),
))
}
}
Value::String(s) => Ok(ParsedValue::String(s.clone())),
_ => Err(GraphqlError::UnsupportedValueType(value.to_string())),
}
}