pub struct ResolvedPath {
pub repeats: bool,
pub leaf_type: Option<String>,
}Fields§
§repeats: boolWhether any element along the path may occur more than once. True for
Patient.name.family, because name repeats even though family
does not.
leaf_type: Option<String>The FHIR type of the element the path ends on, when the element
declares exactly one. None for a choice element or a backbone.
Trait Implementations§
Source§impl Clone for ResolvedPath
impl Clone for ResolvedPath
Source§impl Debug for ResolvedPath
impl Debug for ResolvedPath
impl Eq for ResolvedPath
Source§impl PartialEq for ResolvedPath
impl PartialEq for ResolvedPath
impl StructuralPartialEq for ResolvedPath
Auto Trait Implementations§
impl Freeze for ResolvedPath
impl RefUnwindSafe for ResolvedPath
impl Send for ResolvedPath
impl Sync for ResolvedPath
impl Unpin for ResolvedPath
impl UnsafeUnpin for ResolvedPath
impl UnwindSafe for ResolvedPath
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<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
Compare self to
key and return true if they are equal.