Struct graphql_federated_graph::FieldType
source · pub struct FieldType {
pub kind: Definition,
pub inner_is_required: bool,
pub list_wrappers: Vec<ListWrapper>,
}
Fields§
§kind: Definition
§inner_is_required: bool
Is the innermost type required?
Examples:
String
=> falseString!
=> true[String!]
=> true[String]!
=> false
list_wrappers: Vec<ListWrapper>
Innermost to outermost.
Trait Implementations§
source§impl<'de> Deserialize<'de> for FieldType
impl<'de> Deserialize<'de> for FieldType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq for FieldType
impl PartialEq for FieldType
impl Eq for FieldType
impl StructuralPartialEq for FieldType
Auto Trait Implementations§
impl RefUnwindSafe for FieldType
impl Send for FieldType
impl Sync for FieldType
impl Unpin for FieldType
impl UnwindSafe for FieldType
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
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.