[−][src]Struct json_ld::object::node::Node
A node object.
Methods
impl<T: Id> Node<T>
[src]
pub fn new() -> Node<T>
[src]
pub fn id(&self) -> Option<&Lenient<Reference<T>>>
[src]
pub fn has_key(&self, key: &Term<T>) -> bool
[src]
pub fn types(&self) -> &[Lenient<Reference<T>>]
[src]
pub fn has_type<U>(&self, ty: &U) -> bool where
Lenient<Reference<T>>: PartialEq<U>,
[src]
Lenient<Reference<T>>: PartialEq<U>,
pub fn is_empty(&self) -> bool
[src]
Test if the node is empty.
It is empty is every field except for @id
is empty.
pub fn is_graph(&self) -> bool
[src]
pub fn as_iri(&self) -> Option<Iri>
[src]
pub fn as_str(&self) -> Option<&str>
[src]
pub fn get<'a, Q: ToReference<T>>(&self, prop: Q) -> Objects<T> where
T: 'a,
[src]
T: 'a,
pub fn insert(&mut self, prop: Reference<T>, value: Indexed<Object<T>>)
[src]
pub fn insert_all<Objects: Iterator<Item = Indexed<Object<T>>>>(
&mut self,
prop: Reference<T>,
values: Objects
)
[src]
&mut self,
prop: Reference<T>,
values: Objects
)
pub fn insert_reverse(
&mut self,
reverse_prop: Reference<T>,
reverse_value: Indexed<Node<T>>
)
[src]
&mut self,
reverse_prop: Reference<T>,
reverse_value: Indexed<Node<T>>
)
pub fn insert_all_reverse<Nodes: Iterator<Item = Indexed<Node<T>>>>(
&mut self,
reverse_prop: Reference<T>,
reverse_values: Nodes
)
[src]
&mut self,
reverse_prop: Reference<T>,
reverse_values: Nodes
)
pub fn is_unnamed_graph(&self) -> bool
[src]
pub fn into_unnamed_graph(self) -> Result<HashSet<Indexed<Object<T>>>, Node<T>>
[src]
Trait Implementations
impl<T: Id> AsJson for Node<T>
[src]
impl<T: Eq + Id> Eq for Node<T>
[src]
impl<T: Id> From<Node<T>> for Object<T>
[src]
impl<T: Id> Hash for Node<T>
[src]
fn hash<H: Hasher>(&self, h: &mut H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<T: PartialEq + Id> PartialEq<Node<T>> for Node<T>
[src]
impl<T: Id> StructuralEq for Node<T>
[src]
impl<T: Id> StructuralPartialEq for Node<T>
[src]
impl<T: Id> TryFrom<Object<T>> for Node<T>
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for Node<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for Node<T> where
T: Send,
T: Send,
impl<T> Sync for Node<T> where
T: Sync,
T: Sync,
impl<T> Unpin for Node<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for Node<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T
[src]
type Owned = T
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,