pub enum MaybeUndefined<T> {
Undefined,
Null,
Value(T),
}
Expand description
Similar to Option
, but it has three states, undefined
, null
and x
.
Reference: https://spec.graphql.org/October2021/#sec-Null-Value
§Examples
use async_graphql::*;
struct Query;
#[Object]
impl Query {
async fn value1(&self, input: MaybeUndefined<i32>) -> i32 {
if input.is_null() {
1
} else if input.is_undefined() {
2
} else {
input.take().unwrap()
}
}
}
let schema = Schema::new(Query, EmptyMutation, EmptySubscription);
let query = r#"
{
v1:value1(input: 99)
v2:value1(input: null)
v3:value1
}"#;
assert_eq!(
schema.execute(query).await.into_result().unwrap().data,
value!({
"v1": 99,
"v2": 1,
"v3": 2,
})
);
Variants§
Implementations§
Source§impl<T> MaybeUndefined<T>
impl<T> MaybeUndefined<T>
Sourcepub const fn is_undefined(&self) -> bool
pub const fn is_undefined(&self) -> bool
Returns true if the MaybeUndefined<T>
is undefined.
Sourcepub const fn value(&self) -> Option<&T>
pub const fn value(&self) -> Option<&T>
Borrow the value, returns None
if the the MaybeUndefined<T>
is
undefined
or null
, otherwise returns Some(T)
.
Sourcepub const fn as_opt_ref(&self) -> Option<Option<&T>>
pub const fn as_opt_ref(&self) -> Option<Option<&T>>
Converts the MaybeUndefined<T>
to Option<Option<T>>
.
Sourcepub fn as_opt_deref<U>(&self) -> Option<Option<&U>>
pub fn as_opt_deref<U>(&self) -> Option<Option<&U>>
Converts the MaybeUndefined<T>
to Option<Option<&U>>
.
Sourcepub fn contains_value<U>(&self, x: &U) -> boolwhere
U: PartialEq<T>,
pub fn contains_value<U>(&self, x: &U) -> boolwhere
U: PartialEq<T>,
Returns true
if the MaybeUndefined<T>
contains the given value.
Sourcepub fn contains<U>(&self, x: &Option<U>) -> boolwhere
U: PartialEq<T>,
pub fn contains<U>(&self, x: &Option<U>) -> boolwhere
U: PartialEq<T>,
Returns true
if the MaybeUndefined<T>
contains the given nullable
value.
Sourcepub fn map<U, F: FnOnce(Option<T>) -> Option<U>>(
self,
f: F,
) -> MaybeUndefined<U>
pub fn map<U, F: FnOnce(Option<T>) -> Option<U>>( self, f: F, ) -> MaybeUndefined<U>
Maps a MaybeUndefined<T>
to MaybeUndefined<U>
by applying a function
to the contained nullable value
Sourcepub fn map_value<U, F: FnOnce(T) -> U>(self, f: F) -> MaybeUndefined<U>
pub fn map_value<U, F: FnOnce(T) -> U>(self, f: F) -> MaybeUndefined<U>
Maps a MaybeUndefined<T>
to MaybeUndefined<U>
by applying a function
to the contained value
Sourcepub fn update_to(self, value: &mut Option<T>)
pub fn update_to(self, value: &mut Option<T>)
Update value
if the MaybeUndefined<T>
is not undefined.
§Example
use async_graphql::MaybeUndefined;
let mut value = None;
MaybeUndefined::Value(10i32).update_to(&mut value);
assert_eq!(value, Some(10));
MaybeUndefined::Undefined.update_to(&mut value);
assert_eq!(value, Some(10));
MaybeUndefined::Null.update_to(&mut value);
assert_eq!(value, None);
Source§impl<T, E> MaybeUndefined<Result<T, E>>
impl<T, E> MaybeUndefined<Result<T, E>>
Sourcepub fn transpose(self) -> Result<MaybeUndefined<T>, E>
pub fn transpose(self) -> Result<MaybeUndefined<T>, E>
Transposes a MaybeUndefined
of a Result
into a Result
of a
MaybeUndefined
.
MaybeUndefined::Undefined
will be mapped to
Ok
(
MaybeUndefined::Undefined
)
. MaybeUndefined::Null
will be mapped to Ok
(
MaybeUndefined::Null
)
.
MaybeUndefined::Value
(
Ok
(_))
and
MaybeUndefined::Value
(
Err
(_))
will be mapped to
Ok
(
MaybeUndefined::Value
(_))
and Err
(_)
.
Trait Implementations§
Source§impl<T: Clone> Clone for MaybeUndefined<T>
impl<T: Clone> Clone for MaybeUndefined<T>
Source§fn clone(&self) -> MaybeUndefined<T>
fn clone(&self) -> MaybeUndefined<T>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<T: Debug> Debug for MaybeUndefined<T>
impl<T: Debug> Debug for MaybeUndefined<T>
Source§impl<T> Default for MaybeUndefined<T>
impl<T> Default for MaybeUndefined<T>
Source§impl<'de, T> Deserialize<'de> for MaybeUndefined<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for MaybeUndefined<T>where
T: Deserialize<'de>,
Source§fn deserialize<D>(deserializer: D) -> Result<MaybeUndefined<T>, D::Error>where
D: Deserializer<'de>,
fn deserialize<D>(deserializer: D) -> Result<MaybeUndefined<T>, D::Error>where
D: Deserializer<'de>,
Source§impl<T> From<MaybeUndefined<T>> for Option<Option<T>>
impl<T> From<MaybeUndefined<T>> for Option<Option<T>>
Source§fn from(maybe_undefined: MaybeUndefined<T>) -> Self
fn from(maybe_undefined: MaybeUndefined<T>) -> Self
Source§impl<T: Hash> Hash for MaybeUndefined<T>
impl<T: Hash> Hash for MaybeUndefined<T>
Source§impl<T: InputType> InputType for MaybeUndefined<T>
impl<T: InputType> InputType for MaybeUndefined<T>
Source§type RawValueType = <T as InputType>::RawValueType
type RawValueType = <T as InputType>::RawValueType
Source§fn qualified_type_name() -> String
fn qualified_type_name() -> String
Source§fn create_type_info(registry: &mut Registry) -> String
fn create_type_info(registry: &mut Registry) -> String
Source§fn parse(value: Option<Value>) -> InputValueResult<Self>
fn parse(value: Option<Value>) -> InputValueResult<Self>
Value
. None represents undefined.Source§fn as_raw_value(&self) -> Option<&Self::RawValueType>
fn as_raw_value(&self) -> Option<&Self::RawValueType>
Source§impl<T: Ord> Ord for MaybeUndefined<T>
impl<T: Ord> Ord for MaybeUndefined<T>
Source§fn cmp(&self, other: &MaybeUndefined<T>) -> Ordering
fn cmp(&self, other: &MaybeUndefined<T>) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl<T: PartialEq> PartialEq for MaybeUndefined<T>
impl<T: PartialEq> PartialEq for MaybeUndefined<T>
Source§impl<T: PartialOrd> PartialOrd for MaybeUndefined<T>
impl<T: PartialOrd> PartialOrd for MaybeUndefined<T>
Source§impl<T: Serialize> Serialize for MaybeUndefined<T>
impl<T: Serialize> Serialize for MaybeUndefined<T>
impl<T: Copy> Copy for MaybeUndefined<T>
impl<T: Eq> Eq for MaybeUndefined<T>
impl<T> StructuralPartialEq for MaybeUndefined<T>
Auto Trait Implementations§
impl<T> Freeze for MaybeUndefined<T>where
T: Freeze,
impl<T> RefUnwindSafe for MaybeUndefined<T>where
T: RefUnwindSafe,
impl<T> Send for MaybeUndefined<T>where
T: Send,
impl<T> Sync for MaybeUndefined<T>where
T: Sync,
impl<T> Unpin for MaybeUndefined<T>where
T: Unpin,
impl<T> UnwindSafe for MaybeUndefined<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.