Struct columnar::adts::json::Jsons

pub struct Jsons {
    pub roots: Vec<JsonIdx>,
    pub numbers: Vec<Number>,
    pub strings: Lookbacks<Strings>,
    pub arrays: Vecs<Vec<JsonIdx>>,
    pub objects: Vecs<(Lookbacks<Strings>, Vec<JsonIdx>)>,
}

Stand-in for Vec<Json>.

This approach uses indexes which contains discriminants, which should allow an efficient representation of offset information. Unfortunately, both arrays and objects just list their intended offsets directly, rather than encode the offsets using unary degree sequences, which seemed hard to thread through the other abstractions. Their Vec<usize> container can probably be made smarter, in particular by an Option<usize> container where None indicates increment. Stand-in for Vec<Json>.

The roots vector indicates the root of each stored Json. The (transitive) contents of each Json are stored throughout, at locations that may not necessarily be found in roots.

Fields

roots: Vec<JsonIdx>

numbers: Vec<Number>

strings: Lookbacks<Strings>

arrays: Vecs<Vec<JsonIdx>>

objects: Vecs<(Lookbacks<Strings>, Vec<JsonIdx>)>

Implementations

impl Jsons

pub fn dereference(&self, index: JsonIdx) -> JsonsRef<'_>

Trait Implementations

impl Clone for Jsons

fn clone(&self) -> Jsons

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Jsons

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Jsons

fn default() -> Jsons

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Jsons

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl HeapSize for Jsons

fn heap_size(&self) -> (usize, usize)

Active (len) and allocated (cap) heap sizes in bytes. This should not include the size of self itself.

impl<'a> Index for &'a Jsons

type Ref = JsonsRef<'a>

The type returned by the get method.

fn get(&self, index: usize) -> Self::Ref

fn last(&self) -> Option<Self::Ref>

where Self: Len,

fn iter(&self) -> IterOwn<&Self>

fn into_iter(self) -> IterOwn<Self>

where Self: Sized,

impl Len for Jsons

fn len(&self) -> usize

The number of contained elements.

fn is_empty(&self) -> bool

Whether this contains no elements.

impl PartialEq for Jsons

fn eq(&self, other: &Jsons) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> Push<&'a Json> for Jsons

fn push(&mut self, json: &'a Json)

Pushes an item onto self.

fn extend(&mut self, jsons: impl IntoIterator<Item = &'a Json>)

Pushes elements of an iterator onto self.

impl Push<Json> for Jsons

fn push(&mut self, json: Json)

Pushes an item onto self.

fn extend(&mut self, iter: impl IntoIterator<Item = T>)

Pushes elements of an iterator onto self.

impl Serialize for Jsons

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Jsons