Struct SmartList 

pub struct SmartList<T> {
    pub data: Vec<T>,
    pub total_count: Option<u64>,
    pub aggregations: Record,
    pub summary: Record,
    pub facets: BTreeMap<String, SmartList<Record>>,
}

Fields

data: Vec<T>

total_count: Option<u64>

aggregations: Record

summary: Record

facets: BTreeMap<String, SmartList<Record>>

Implementations

impl<T> SmartList<T>

pub fn empty() -> Self

pub fn new(data: Vec<T>) -> Self

pub fn with_total_count(self, total_count: u64) -> Self

pub fn with_aggregation( self, key: impl Into<String>, value: impl Into<Value>, ) -> Self

pub fn with_summary( self, key: impl Into<String>, value: impl Into<Value>, ) -> Self

pub fn with_facet( self, key: impl Into<String>, facet: SmartList<Record>, ) -> Self

pub fn add_facet(&mut self, key: impl Into<String>, facet: SmartList<Record>)

pub fn facets(&self) -> &BTreeMap<String, SmartList<Record>>

pub fn facets_mut(&mut self) -> &mut BTreeMap<String, SmartList<Record>>

pub fn facet(&self, key: &str) -> Option<&SmartList<Record>>

pub fn facet_mut(&mut self, key: &str) -> Option<&mut SmartList<Record>>

pub fn remove_facet(&mut self, key: &str) -> Option<SmartList<Record>>

pub fn take_facets(&mut self) -> BTreeMap<String, SmartList<Record>>

pub fn push(&mut self, value: T)

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

pub fn set(&mut self, index: usize, value: T) -> Option<T>

pub fn get(&self, index: usize) -> Option<&T>

pub fn get_mut(&mut self, index: usize) -> Option<&mut T>

pub fn last(&self) -> Option<&T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn first(&self) -> Option<&T>

pub fn iter(&self) -> Iter<'_, T>

pub fn iter_mut(&mut self) -> IterMut<'_, T>

pub fn as_slice(&self) -> &[T]

pub fn as_mut_slice(&mut self) -> &mut [T]

pub fn retain(&mut self, filter: impl FnMut(&T) -> bool)

pub fn total_count_or_len(&self) -> u64

pub fn aggregation(&self, key: &str) -> Option<&Value>

pub fn summary(&self, key: &str) -> Option<&Value>

pub fn aggregation_json(&self) -> Value

pub fn summary_json(&self) -> Value

pub fn into_vec(self) -> Vec<T>

pub fn map<U>(self, mapper: impl FnMut(T) -> U) -> SmartList<U>

pub fn to_list<U>(&self, mapper: impl FnMut(&T) -> U) -> Vec<U>

pub fn to_set<U>(&self, mapper: impl FnMut(&T) -> U) -> BTreeSet<U>

where U: Ord,

pub fn identity_map<K>(&self, key: impl FnMut(&T) -> K) -> BTreeMap<K, T>

where K: Ord, T: Clone,

pub fn group_by<K>(&self, key: impl FnMut(&T) -> K) -> BTreeMap<K, Vec<T>>

where K: Ord, T: Clone,

pub fn merge_by<K>( &mut self, incoming: impl IntoIterator<Item = T>, key: impl FnMut(&T) -> K, )

where K: Eq + Hash,

pub fn into_records(self) -> SmartList<Record>

where T: Entity,

impl<T> SmartList<T>

where T: IdentifiableEntity,

pub fn ids(&self) -> Vec<Value>

pub fn map_by_id(&self) -> BTreeMap<String, T>

where T: Clone,

impl<T> SmartList<T>

where T: VersionedEntity,

pub fn versions(&self) -> Vec<i64>

Trait Implementations

impl<T: Clone> Clone for SmartList<T>

fn clone(&self) -> SmartList<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for SmartList<T>

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

Formats the value using the given formatter.

impl<T> Default for SmartList<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Extend<T> for SmartList<T>

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> From<Vec<T>> for SmartList<T>

fn from(data: Vec<T>) -> Self

Converts to this type from the input type.

impl<T> FromIterator<T> for SmartList<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T> Index<usize> for SmartList<T>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for SmartList<T>

fn index_mut(&mut self, index: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'a, T> IntoIterator for &'a SmartList<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut SmartList<T>

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for SmartList<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for SmartList<T>

fn eq(&self, other: &SmartList<T>) -> 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<T> TeaqlEmpty for SmartList<T>

fn teaql_is_empty(&self) -> bool

impl<T> StructuralPartialEq for SmartList<T>