Enum TopPaths

pub enum TopPaths<'a, T> {
    RootPointer(RootPointer<'a, T>),
    ObjectField(ObjectField<'a, T>),
    Chain(Chain<'a, T>),
    Wildcard(Wildcard<T>),
    DescentObject(DescentObject<'a, T>),
    DescentWildcard(DescentWildcard<T>),
    Current(Current<'a, T>),
    ArrayIndex(ArrayIndex<T>),
    ArraySlice(ArraySlice<T>),
    UnionIndex(UnionIndex<'a, T>),
    FilterPath(FilterPath<'a, T>),
    IdentityPath(IdentityPath<T>),
    FnPath(FnPath<T>),
}

all known Paths, mostly to avoid a dynamic Box and vtable for internal function

Variants

RootPointer(RootPointer<'a, T>)

ObjectField(ObjectField<'a, T>)

Chain(Chain<'a, T>)

Wildcard(Wildcard<T>)

DescentObject(DescentObject<'a, T>)

DescentWildcard(DescentWildcard<T>)

Current(Current<'a, T>)

ArrayIndex(ArrayIndex<T>)

ArraySlice(ArraySlice<T>)

UnionIndex(UnionIndex<'a, T>)

FilterPath(FilterPath<'a, T>)

IdentityPath(IdentityPath<T>)

FnPath(FnPath<T>)

Trait Implementations

impl<'a, T> Path<'a> for TopPaths<'a, T>

where T: JsonLike,

type Data = T

fn find( &self, input: JsonPathValue<'a, Self::Data>, ) -> Vec<JsonPathValue<'a, Self::Data>>

when every element needs to handle independently

fn flat_find( &self, input: Vec<JsonPathValue<'a, Self::Data>>, _is_search_length: bool, ) -> Vec<JsonPathValue<'a, Self::Data>>

when the whole output needs to handle

fn needs_all(&self) -> bool

defines when we need to invoke find or flat_find