ingraph 0.1.0

A declaration-driven indexing framework: records and nodes are written as Rust types, and the storage rows, the dataflow between them and the GraphQL query surface are emitted from the declaration.
Documentation
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
//! The geometry family's WIRE FACES — the three holders as GraphQL objects, the three filters as
//! input objects, and the composed names that keep two instantiations of one holder apart.
//!
//! ```text
//! type Point2F32       { x: Float!  y: Float! }
//! type BoundingBoxF32  { x: Float!  y: Float!  width: Float!  height: Float! }
//! type QuadF32         { topLeft: Point2F32!  topRight: Point2F32!
//!                        bottomRight: Point2F32!  bottomLeft: Point2F32! }
//!
//! input Point2F32Filter      { x: F32Filter  y: F32Filter }
//! input BoundingBoxF32Filter { x: F32Filter  y: F32Filter  area: F32Filter
//!                              width: F32Filter  height: F32Filter }
//! input QuadF32Filter        { topLeft: Point2F32Filter  topRight: Point2F32Filter
//!                              bottomRight: Point2F32Filter  bottomLeft: Point2F32Filter }
//! ```
//!
//! # THE NAMES COMPOSE, and GraphQL's flat namespace is what forces it
//!
//! A holder here is GENERIC, and a schema may hold two instantiations of one — a normalized box
//! beside a metric one is an ordinary shape for a pipeline that reports both. GraphQL keeps ONE FLAT
//! NAMESPACE, so two types called `BoundingBox` are a name async-graphql resolves in silence, taking
//! the first walked and dropping the second with its fields. Composing the component's own published
//! name onto the holder's is what makes the pair spellable: `BoundingBoxF32` and `BoundingBoxF64`
//! are two names for two types.
//!
//! That is [`TimeRanged<T>`](crate::TimeRanged)'s own law read at this family's arity, and the OUTPUT
//! and INPUT halves compose from different sources for that type's reason: an object's name is built
//! from the COMPONENT's published form and a filter's from the COMPONENT FILTER's, so
//! `BoundingBoxF32` and `BoundingBoxF32Filter` sit beside each other without either colliding with
//! the other.
//!
//! # THE TAIL IS PASCAL, and one expression is what makes it so
//!
//! The two sources disagree about case: a component FILTER is Pascal by the roster's law and a
//! component SCALAR is lowercase by the constitution's first one, so an untouched composition
//! published `BoundingBoxf32` beside `BoundingBoxF32Filter` — the sketch above and the code
//! disagreeing, with the code being what a client saw. Ruled 2026-08-29: **a Rust width is not a
//! name**, so a COMPOSED name raises its tail while the roster scalar keeps its own spelling where
//! it stands alone. [`composed_tail`](crate::graphql::output::composed_tail) is that raise, shared
//! with the detect house one door over so a schema holding both carries one convention.
//!
//! **A `NormCoord` box publishes `BoundingBoxF32`, not `BoundingBoxNormCoord`**, and that follows
//! from the coordinate having no scalar of its own: it crosses as `f32`'s roster carrier, so the
//! name composed from its published form is the width's. See [`NormCoord`](super::NormCoord), where
//! the retirement that decided it is argued.
//!
//! # NO WHOLE-VALUE OPERAND ANYWHERE IN THE HOUSE
//!
//! There is no `#[Scalar]` here and no `…Operand` newtype beside any of the three. Every other
//! composite in this crate mints one — a timebase, a range, a language id — because each has a
//! whole-value operator (`eq`, `exact`, `overlaps`) whose operand needs a form to arrive in. These
//! have none: the filters are COMPONENT FACETS and nothing else, so no slot ever holds a whole box,
//! and an operand for a door that does not exist would be a scalar in a schema no query can name.
//! See [`BoundingBoxFilter`](super::BoundingBoxFilter), where that posture is argued.
//!
//! It follows that the crossing map carries no [`ToGraphqlInput`](crate::ToGraphqlInput) row for the
//! three holders either. What a client SENDS about a box is a filter; what it READS back is the
//! object below.

use std::borrow::Cow;

use async_graphql::{
  InputObjectType, InputType, InputValueError, InputValueResult, Object, OutputType, TypeName,
  Value,
  registry::{MetaInputValue, MetaType, MetaTypeId, Registry},
};

use crate::{NullableFace, Sent, ToGraphqlOutput, graphql::output::composed_tail, sent};

use super::{BoundingBox, BoundingBoxFilter, Point2, Point2Filter, Quad, QuadFilter};

/// What a bare value at any of this family's filter faces omits.
///
/// ONE sentence for all three, because the omission is the same one at every arity: a holder's
/// filter is a set of COMPONENT facets with no whole-value slot for a bare value to land in, so
/// there is no reading to pick and the refusal names the fields instead. That is
/// [`MediaSpanDurationFilter`](crate::MediaSpanDurationFilter)'s `shorthand = false` argument
/// reached by a different road — there the four bounds were each as plausible as the others, here
/// there is no whole-value operator at all.
const NO_GEOMETRY_SHORTHAND: &str = "a geometry filter asks about COMPONENTS: name the fields you mean — a bare value does not say \
   which of them it is asking about, and there is no whole-shape operator for it to be";

/// `Point2<T>` publishes `Point2` before the COMPONENT's own published name — `Point2F32` for a
/// normalized or a plain single-precision position.
///
/// The bound is [`ToGraphqlOutput`] rather than [`OutputType`], which is this crate's crossing map
/// read where async-graphql would have read its own: a component reaches the wire through the form
/// its row names, and that form is what carries a published name. `'static` is what makes
/// `Output<'static>` nameable at all — a name is asked for with no value in hand.
impl<T> TypeName for Point2<T>
where
  T: ToGraphqlOutput + Send + Sync + 'static,
  for<'a> T::Output<'a>: OutputType,
{
  #[inline]
  fn type_name() -> Cow<'static, str> {
    Cow::Owned(format!(
      "Point2{}",
      composed_tail(&<T::Output<'static> as OutputType>::type_name())
    ))
  }
}

/// A position in a plane, with the TOP-LEFT ORIGIN this family measures against: `x` grows to the
/// right and `y` grows DOWNWARD.
///
/// Both fields are NON-NULL — a position has two components or it is not one.
#[Object(name_type)]
impl<T> Point2<T>
where
  T: ToGraphqlOutput + Copy + Send + Sync + 'static,
  for<'a> T::Output<'a>: OutputType,
{
  /// The horizontal component, growing to the RIGHT of the frame's left edge.
  #[doc(hidden)]
  #[graphql(name = "x")]
  async fn __async_graphql_x__(&self) -> T::Output<'_> {
    T::to_graphql_output(&self.x)
  }

  /// The vertical component, growing DOWNWARD from the frame's top edge.
  #[doc(hidden)]
  #[graphql(name = "y")]
  async fn __async_graphql_y__(&self) -> T::Output<'_> {
    T::to_graphql_output(&self.y)
  }
}

/// **The crossing OUT** — a BORROW, resolved by the `#[Object]` above.
impl<T> ToGraphqlOutput for Point2<T> {
  type Output<'a>
    = &'a Self
  where
    T: 'a;

  #[inline]
  fn to_graphql_output(marked: &Self) -> &Self {
    marked
  }
}

/// `BoundingBox<T>` publishes `BoundingBox` before the component's own published name.
impl<T> TypeName for BoundingBox<T>
where
  T: ToGraphqlOutput + Send + Sync + 'static,
  for<'a> T::Output<'a>: OutputType,
{
  #[inline]
  fn type_name() -> Cow<'static, str> {
    Cow::Owned(format!(
      "BoundingBox{}",
      composed_tail(&<T::Output<'static> as OutputType>::type_name())
    ))
  }
}

/// An axis-aligned rectangle: its TOP-LEFT corner and its two extents.
///
/// All four fields are NON-NULL. There is no `right` or `bottom` field beside them, and the absence
/// is the storage argument said to a client: an edge is `x + width`, which a client computes exactly
/// and which a stored fifth number could come to disagree with.
#[Object(name_type)]
impl<T> BoundingBox<T>
where
  T: ToGraphqlOutput + Copy + Send + Sync + 'static,
  for<'a> T::Output<'a>: OutputType,
{
  /// The left edge.
  #[doc(hidden)]
  #[graphql(name = "x")]
  async fn __async_graphql_x__(&self) -> T::Output<'_> {
    T::to_graphql_output(&self.x)
  }

  /// The top edge.
  #[doc(hidden)]
  #[graphql(name = "y")]
  async fn __async_graphql_y__(&self) -> T::Output<'_> {
    T::to_graphql_output(&self.y)
  }

  /// How far the rectangle reaches to the right of `x`. Strictly positive where the component is a
  /// normalized coordinate built through `try_unit`.
  #[doc(hidden)]
  #[graphql(name = "width")]
  async fn __async_graphql_width__(&self) -> T::Output<'_> {
    T::to_graphql_output(&self.width)
  }

  /// How far the rectangle reaches below `y`. Strictly positive on `width`'s terms.
  #[doc(hidden)]
  #[graphql(name = "height")]
  async fn __async_graphql_height__(&self) -> T::Output<'_> {
    T::to_graphql_output(&self.height)
  }
}

/// **The crossing OUT** — a BORROW, resolved by the `#[Object]` above.
impl<T> ToGraphqlOutput for BoundingBox<T> {
  type Output<'a>
    = &'a Self
  where
    T: 'a;

  #[inline]
  fn to_graphql_output(marked: &Self) -> &Self {
    marked
  }
}

/// `Quad<T>` publishes `Quad` before the component's own published name.
impl<T> TypeName for Quad<T>
where
  T: ToGraphqlOutput + Send + Sync + 'static,
  for<'a> T::Output<'a>: OutputType,
{
  #[inline]
  fn type_name() -> Cow<'static, str> {
    Cow::Owned(format!(
      "Quad{}",
      composed_tail(&<T::Output<'static> as OutputType>::type_name())
    ))
  }
}

/// A quadrilateral, its four corners published under their NAMES.
///
/// The names are what carry the winding order to a client — top-left, top-right, bottom-right,
/// bottom-left — where a `corners: [Point2!]!` list would carry it in a doc comment and lose it to
/// the first consumer that indexed the array by guess.
#[Object(name_type)]
impl<T> Quad<T>
where
  T: ToGraphqlOutput + Copy + Send + Sync + 'static,
  for<'a> T::Output<'a>: OutputType,
{
  /// The FIRST corner in winding order.
  #[doc(hidden)]
  #[graphql(name = "topLeft")]
  async fn __async_graphql_top_left__(&self) -> Point2<T> {
    self.top_left()
  }

  /// The SECOND corner in winding order.
  #[doc(hidden)]
  #[graphql(name = "topRight")]
  async fn __async_graphql_top_right__(&self) -> Point2<T> {
    self.top_right()
  }

  /// The THIRD corner in winding order — diagonally opposite `topLeft`, never adjacent to it.
  #[doc(hidden)]
  #[graphql(name = "bottomRight")]
  async fn __async_graphql_bottom_right__(&self) -> Point2<T> {
    self.bottom_right()
  }

  /// The FOURTH corner in winding order, closing the perimeter back to `topLeft`.
  #[doc(hidden)]
  #[graphql(name = "bottomLeft")]
  async fn __async_graphql_bottom_left__(&self) -> Point2<T> {
    self.bottom_left()
  }
}

/// **The crossing OUT** — a BORROW, resolved by the `#[Object]` above.
impl<T> ToGraphqlOutput for Quad<T> {
  type Output<'a>
    = &'a Self
  where
    T: 'a;

  #[inline]
  fn to_graphql_output(marked: &Self) -> &Self {
    marked
  }
}

/// The field list [`Point2Filter`]'s face registers, in declaration order.
fn point_fields<CF>(
  registry: &mut Registry,
) -> async_graphql::indexmap::IndexMap<String, MetaInputValue>
where
  CF: InputType,
{
  crate::__ingraph_filter_input_fields!(registry, "x" : Option<CF>, "y" : Option<CF>,)
}

/// The object [`Point2Filter`]'s face renders — the same two names in the same order.
fn point_values<CF>(
  filter: &Point2Filter<CF>,
) -> async_graphql::indexmap::IndexMap<async_graphql::Name, Value>
where
  CF: InputType,
{
  crate::__ingraph_filter_value_map!(filter, "x" : x, "y" : y)
}

/// **The TWO-FACET face**, named `Point2` before the COMPONENT FILTER's own input name.
impl<CF> InputType for Point2Filter<CF>
where
  CF: InputType,
{
  type RawValueType = Self;

  #[inline]
  fn type_name() -> Cow<'static, str> {
    Cow::Owned(format!("Point2{}", <CF as InputType>::type_name()))
  }

  fn create_type_info(registry: &mut Registry) -> String {
    registry.create_input_type::<Self, _>(MetaTypeId::InputObject, |registry| {
      MetaType::InputObject {
        name: String::from(<Self as InputType>::type_name()),
        description: None,
        input_fields: <Self as NullableFace>::bare_fields(registry),
        visible: None,
        inaccessible: false,
        tags: Vec::new(),
        rust_typename: Some(std::any::type_name::<Self>()),
        oneof: false,
        directive_invocations: Vec::new(),
      }
    })
  }

  /// # NO SHORTHAND — see [`NO_GEOMETRY_SHORTHAND`]
  fn parse(value: Option<Value>) -> InputValueResult<Self> {
    let object = match sent(value) {
      Sent::Longhand(object) => object,
      Sent::Bare(_) => return Err(InputValueError::custom(NO_GEOMETRY_SHORTHAND)),
      Sent::Null => return Err(InputValueError::expected_type(Value::Null)),
      Sent::Refused(refused) => return Err(InputValueError::expected_type(refused)),
    };

    Ok(Self {
      x: InputType::parse(object.get("x").cloned()).map_err(InputValueError::propagate)?,
      y: InputType::parse(object.get("y").cloned()).map_err(InputValueError::propagate)?,
    })
  }

  fn to_value(&self) -> Value {
    Value::Object(<Self as NullableFace>::bare_values(self))
  }

  #[inline]
  fn as_raw_value(&self) -> Option<&Self::RawValueType> {
    Some(self)
  }
}

impl<CF: InputType> InputObjectType for Point2Filter<CF> {}

/// The NULLABLE row — the two pieces [`Nullable`](crate::Nullable)'s blanket assembles this face's
/// twin from, so an `Option<Point2<T>>` column publishes the filter with `isNull` appended and no
/// second field list anywhere.
impl<CF: InputType> NullableFace for Point2Filter<CF> {
  fn bare_fields(
    registry: &mut Registry,
  ) -> async_graphql::indexmap::IndexMap<String, MetaInputValue> {
    point_fields::<CF>(registry)
  }

  fn bare_values(&self) -> async_graphql::indexmap::IndexMap<async_graphql::Name, Value> {
    point_values(self)
  }
}

/// The field list [`BoundingBoxFilter`]'s face registers, in declaration order.
///
/// **`area` is LAST and it is the DERIVED one**, published under the same component filter the four
/// stored facets take. That is the wide-wire law at this seat: the operand of *how much of the frame
/// is this* is a measurement in the component's own units, so it is asked with the component's own
/// input object rather than with a narrowed kind that would owe a client an explanation.
fn box_fields<CF>(
  registry: &mut Registry,
) -> async_graphql::indexmap::IndexMap<String, MetaInputValue>
where
  CF: InputType,
{
  crate::__ingraph_filter_input_fields!(
    registry,
    "x" : Option<CF>,
    "y" : Option<CF>,
    "width" : Option<CF>,
    "height" : Option<CF>,
    "area" : Option<CF>,
  )
}

/// The object [`BoundingBoxFilter`]'s face renders — the same five names in the same order.
fn box_values<CF>(
  filter: &BoundingBoxFilter<CF>,
) -> async_graphql::indexmap::IndexMap<async_graphql::Name, Value>
where
  CF: InputType,
{
  crate::__ingraph_filter_value_map!(
    filter,
    "x" : x,
    "y" : y,
    "width" : width,
    "height" : height,
    "area" : area
  )
}

/// **The FIVE-FACET face**, named `BoundingBox` before the COMPONENT FILTER's own input name.
impl<CF> InputType for BoundingBoxFilter<CF>
where
  CF: InputType,
{
  type RawValueType = Self;

  #[inline]
  fn type_name() -> Cow<'static, str> {
    Cow::Owned(format!("BoundingBox{}", <CF as InputType>::type_name()))
  }

  fn create_type_info(registry: &mut Registry) -> String {
    registry.create_input_type::<Self, _>(MetaTypeId::InputObject, |registry| {
      MetaType::InputObject {
        name: String::from(<Self as InputType>::type_name()),
        description: None,
        input_fields: <Self as NullableFace>::bare_fields(registry),
        visible: None,
        inaccessible: false,
        tags: Vec::new(),
        rust_typename: Some(std::any::type_name::<Self>()),
        oneof: false,
        directive_invocations: Vec::new(),
      }
    })
  }

  /// # NO SHORTHAND — see [`NO_GEOMETRY_SHORTHAND`]
  fn parse(value: Option<Value>) -> InputValueResult<Self> {
    let object = match sent(value) {
      Sent::Longhand(object) => object,
      Sent::Bare(_) => return Err(InputValueError::custom(NO_GEOMETRY_SHORTHAND)),
      Sent::Null => return Err(InputValueError::expected_type(Value::Null)),
      Sent::Refused(refused) => return Err(InputValueError::expected_type(refused)),
    };

    Ok(Self {
      x: InputType::parse(object.get("x").cloned()).map_err(InputValueError::propagate)?,
      y: InputType::parse(object.get("y").cloned()).map_err(InputValueError::propagate)?,
      width: InputType::parse(object.get("width").cloned()).map_err(InputValueError::propagate)?,
      height: InputType::parse(object.get("height").cloned())
        .map_err(InputValueError::propagate)?,
      area: InputType::parse(object.get("area").cloned()).map_err(InputValueError::propagate)?,
    })
  }

  fn to_value(&self) -> Value {
    Value::Object(<Self as NullableFace>::bare_values(self))
  }

  #[inline]
  fn as_raw_value(&self) -> Option<&Self::RawValueType> {
    Some(self)
  }
}

impl<CF: InputType> InputObjectType for BoundingBoxFilter<CF> {}

/// The NULLABLE row, for [`Point2Filter`]'s reason one arity up.
impl<CF: InputType> NullableFace for BoundingBoxFilter<CF> {
  fn bare_fields(
    registry: &mut Registry,
  ) -> async_graphql::indexmap::IndexMap<String, MetaInputValue> {
    box_fields::<CF>(registry)
  }

  fn bare_values(&self) -> async_graphql::indexmap::IndexMap<async_graphql::Name, Value> {
    box_values(self)
  }
}

/// The field list [`QuadFilter`]'s face registers — the four CORNERS, in winding order.
fn quad_fields<CF>(
  registry: &mut Registry,
) -> async_graphql::indexmap::IndexMap<String, MetaInputValue>
where
  CF: InputType,
{
  crate::__ingraph_filter_input_fields!(
    registry,
    "topLeft" : Option<Point2Filter<CF>>,
    "topRight" : Option<Point2Filter<CF>>,
    "bottomRight" : Option<Point2Filter<CF>>,
    "bottomLeft" : Option<Point2Filter<CF>>,
  )
}

/// The object [`QuadFilter`]'s face renders — the same four names in the same order.
fn quad_values<CF>(
  filter: &QuadFilter<CF>,
) -> async_graphql::indexmap::IndexMap<async_graphql::Name, Value>
where
  CF: InputType,
{
  crate::__ingraph_filter_value_map!(
    filter,
    "topLeft" : top_left,
    "topRight" : top_right,
    "bottomRight" : bottom_right,
    "bottomLeft" : bottom_left
  )
}

/// **The FOUR-CORNER face**, named `Quad` before the COMPONENT FILTER's own input name.
///
/// The name composes from `CF` and not from [`Point2Filter<CF>`], which is what keeps it short and
/// what keeps it HONEST: the corners are this type's own shape rather than a parameter, so a name
/// carrying the nested filter's would repeat `Point2` in a position where nothing varies.
impl<CF> InputType for QuadFilter<CF>
where
  CF: InputType,
{
  type RawValueType = Self;

  #[inline]
  fn type_name() -> Cow<'static, str> {
    Cow::Owned(format!("Quad{}", <CF as InputType>::type_name()))
  }

  fn create_type_info(registry: &mut Registry) -> String {
    registry.create_input_type::<Self, _>(MetaTypeId::InputObject, |registry| {
      MetaType::InputObject {
        name: String::from(<Self as InputType>::type_name()),
        description: None,
        input_fields: <Self as NullableFace>::bare_fields(registry),
        visible: None,
        inaccessible: false,
        tags: Vec::new(),
        rust_typename: Some(std::any::type_name::<Self>()),
        oneof: false,
        directive_invocations: Vec::new(),
      }
    })
  }

  /// # NO SHORTHAND — see [`NO_GEOMETRY_SHORTHAND`]
  fn parse(value: Option<Value>) -> InputValueResult<Self> {
    let object = match sent(value) {
      Sent::Longhand(object) => object,
      Sent::Bare(_) => return Err(InputValueError::custom(NO_GEOMETRY_SHORTHAND)),
      Sent::Null => return Err(InputValueError::expected_type(Value::Null)),
      Sent::Refused(refused) => return Err(InputValueError::expected_type(refused)),
    };

    Ok(Self {
      top_left: InputType::parse(object.get("topLeft").cloned())
        .map_err(InputValueError::propagate)?,
      top_right: InputType::parse(object.get("topRight").cloned())
        .map_err(InputValueError::propagate)?,
      bottom_right: InputType::parse(object.get("bottomRight").cloned())
        .map_err(InputValueError::propagate)?,
      bottom_left: InputType::parse(object.get("bottomLeft").cloned())
        .map_err(InputValueError::propagate)?,
    })
  }

  fn to_value(&self) -> Value {
    Value::Object(<Self as NullableFace>::bare_values(self))
  }

  #[inline]
  fn as_raw_value(&self) -> Option<&Self::RawValueType> {
    Some(self)
  }
}

impl<CF: InputType> InputObjectType for QuadFilter<CF> {}

/// The NULLABLE row, for [`Point2Filter`]'s reason.
impl<CF: InputType> NullableFace for QuadFilter<CF> {
  fn bare_fields(
    registry: &mut Registry,
  ) -> async_graphql::indexmap::IndexMap<String, MetaInputValue> {
    quad_fields::<CF>(registry)
  }

  fn bare_values(&self) -> async_graphql::indexmap::IndexMap<async_graphql::Name, Value> {
    quad_values(self)
  }
}