Struct Value 

pub struct Value {
    pub id: String,
    pub stamp: f64,
    pub dt: u16,
    pub q: f64,
    pub data: Val,
    pub attr: Vec<Value>,
    pub curr: i32,
    pub tags: HashMap<String, String>,
}

Fields

id: String

stamp: f64

dt: u16

q: f64

data: Val

attr: Vec<Value>

curr: i32

tags: HashMap<String, String>

Implementations

impl Value

pub fn attr(&mut self, value: Vec<Value>) -> Self

pub fn attr_merge(&mut self, value: Vec<Value>) -> Self

pub fn attr_add(&mut self, value: Value) -> Self

pub fn attr_len(&self) -> usize

impl Value

pub fn bind(&mut self, appfn: AppFn) -> Self

pub fn bind_values(appfn: AppFn2, value1: Value, value2: Value) -> Value

impl Value

pub fn to_binary(&self) -> Result<Vec<u8>, Error>

pub fn compile(&self) -> Result<Vec<u8>, Box<dyn Error>>

pub fn from_binary(data: Vec<u8>) -> Result<Value, Error>

pub fn wrap(&self) -> Result<Value, Error>

pub fn unwrap(&self) -> Result<Value, Error>

impl Value

pub fn head(&self, n: i64) -> Option<Self>

pub fn tail(&self, n: i64) -> Option<Self>

pub fn at(&self, n: i64) -> Option<Self>

pub fn car(&self) -> Option<Self>

pub fn cdr(&self) -> Option<Self>

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

impl Value

pub fn cast_float(&self) -> Result<f64, Box<dyn Error>>

pub fn cast_int(&self) -> Result<i64, Box<dyn Error>>

pub fn cast_bool(&self) -> Result<bool, Box<dyn Error>>

pub fn cast_string(&self) -> Result<String, Box<dyn Error>>

pub fn cast_bin(&self) -> Result<Vec<u8>, Box<dyn Error>>

pub fn cast_error(&self) -> Result<BundError, Box<dyn Error>>

pub fn cast_list(&self) -> Result<Vec<Value>, Box<dyn Error>>

pub fn cast_raw_embedding(&self) -> Result<Vec<f32>, Box<dyn Error>>

pub fn cast_embedding(&self) -> Result<Vec<Value>, Box<dyn Error>>

pub fn cast_lambda(&self) -> Result<Vec<Value>, Box<dyn Error>>

pub fn cast_pair(&self) -> Result<Vec<Value>, Box<dyn Error>>

pub fn cast_pair_x(&self) -> Result<Value, Box<dyn Error>>

pub fn cast_pair_y(&self) -> Result<Value, Box<dyn Error>>

pub fn cast_result(&self) -> Result<Vec<Value>, Box<dyn Error>>

pub fn cast_dict(&self) -> Result<HashMap<String, Value>, Box<dyn Error>>

pub fn cast_valuemap(&self) -> Result<HashMap<Value, Value>, Box<dyn Error>>

pub fn cast_curry_lambda(&self) -> Result<Value, Box<dyn Error>>

pub fn cast_curry_ptr(&self) -> Result<Value, Box<dyn Error>>

pub fn cast_curry(&self) -> Result<Value, Box<dyn Error>>

pub fn cast_timestamp(&self) -> Result<u128, Box<dyn Error>>

pub fn cast_complex_int(&self) -> Result<Complex<i64>, Box<dyn Error>>

pub fn cast_complex_float(&self) -> Result<Complex<f64>, Box<dyn Error>>

pub fn cast_metrics(&self) -> Result<Vec<Metric>, Box<dyn Error>>

pub fn cast_json(&self) -> Result<Value, Box<dyn Error>>

pub fn cast_queue(&self) -> Result<Value, Box<dyn Error>>

pub fn cast_fifo(&self) -> Result<Value, Box<dyn Error>>

pub fn cast_operator_opcode(&self) -> Result<i32, Box<dyn Error>>

pub fn cast_operator_value(&self) -> Result<Value, Box<dyn Error>>

pub fn cast_operator_value2(&self) -> Result<Value, Box<dyn Error>>

impl Value

pub fn cast_json_to_value(&self) -> Result<Value, Box<dyn Error>>

impl Value

pub fn cast_value_to_json(&self) -> Result<Value, Box<dyn Error>>

impl Value

pub fn cast_matrix(&self) -> Result<Vec<Vec<Value>>, Box<dyn Error>>

impl Value

pub fn wrap_json(&self) -> Result<Value, Box<dyn Error>>

impl Value

pub fn as_json_value(&self) -> Value

impl Value

pub fn conv(&self, t: u16) -> Result<Self, Box<dyn Error>>

impl Value

pub fn conv_inner(&self, t: u16) -> Result<Self, Box<dyn Error>>

impl Value

pub fn from_float(value: f64) -> Self

pub fn from_float32(value: f32) -> Self

pub fn from_int(value: i64) -> Self

pub fn from_int32(value: i32) -> Self

pub fn from_bool(value: bool) -> Self

pub fn make_true() -> Self

pub fn make_false() -> Self

pub fn from_string<N: AsRef<str>>(value: N) -> Self

pub fn from_str(value: &str) -> Self

pub fn from_bin(value: Vec<u8>) -> Self

pub fn make_envelope(value: Vec<u8>) -> Self

pub fn binary() -> Self

pub fn from_error(value: BundError) -> Self

pub fn from_pair(value: (Value, Value)) -> Self

pub fn from_timestamp(value: u128) -> Self

pub fn message(from: Value, to: Value, data: Value) -> Self

impl Value

pub fn from<T: Clone + 'static>(value: T) -> Result<Self, Box<dyn Error>>

impl Value

pub fn nodata() -> Self

pub fn none() -> Self

pub fn context() -> Self

pub fn named_context(name: String) -> Self

pub fn text_buffer(name: String) -> Self

pub fn pair(x: Value, y: Value) -> Self

pub fn ptr(name: String, attrs: Vec<Value>) -> Self

pub fn call(name: String, attrs: Vec<Value>) -> Self

pub fn exit() -> Self

pub fn result() -> Self

pub fn operator(opcode: i32, param1: Value, param2: Value) -> Self

pub fn to_result(value: Vec<Value>) -> Self

pub fn now() -> Self

pub fn from_stamp(t: u128) -> Self

pub fn queue() -> Self

pub fn to_queue(value: Vec<Value>) -> Self

pub fn fifo() -> Self

pub fn to_fifo(value: Vec<Value>) -> Self

pub fn json(value: Value) -> Self

pub fn json_array() -> Self

pub fn json_object() -> Self

pub fn json_wrap(data: String) -> Self

pub fn embedding(value: Vec<f32>) -> Self

impl Value

pub fn pi() -> Self

pub fn e() -> Self

pub fn nan() -> Self

pub fn inf() -> Self

pub fn negative_inf() -> Self

impl Value

pub fn list() -> Self

pub fn from_list(value: Vec<Value>) -> Self

impl Value

pub fn matrix() -> Self

pub fn from_matrix(value: Vec<Vec<Value>>) -> Self

impl Value

pub fn dict() -> Self

pub fn valuemap() -> Self

pub fn from_dict(value: HashMap<String, Value>) -> Self

pub fn from_valuemap(value: HashMap<Value, Value>) -> Self

pub fn info() -> Self

pub fn config() -> Self

pub fn association<N: AsRef<str>>(name: N, value: Value) -> Self

pub fn conditional() -> Self

pub fn conditional_of_type(t: String) -> Self

pub fn conditional_from_dict(value: HashMap<String, Value>) -> Self

pub fn make_class() -> Self

pub fn make_object() -> Self

impl Value

pub fn curry<N: AsRef<str>>(name: N, curry_data: Vec<Value>) -> Self

pub fn ptr_curry<N: AsRef<str> + ToString>( name: N, ptr: N, curry_data: Vec<Value>, ) -> Self

pub fn lambda_curry<N: AsRef<str>>( name: N, lambda: Vec<Value>, curry_data: Vec<Value>, ) -> Self

impl Value

pub fn from_complex_int(value: Complex<i64>) -> Self

pub fn from_complex_float(value: Complex<f64>) -> Self

impl Value

pub fn metrics_n(n: usize) -> Self

pub fn metrics() -> Self

pub fn from_metrics(value: Vec<Metric>) -> Self

impl Value

pub fn is_type(&self, t: u16) -> bool

pub fn is_none(&self) -> bool

pub fn is_json(&self) -> bool

impl Value

pub fn dup(&self) -> Result<Value, Error>

impl Value

pub fn calc_q(&mut self, other: Value) -> &mut Self

pub fn set_q(&mut self, q: f64) -> &mut Self

pub fn get_q(&self) -> f64

impl Value

pub fn maybe(&self, appfn: MaybeFn) -> Self

pub fn left_right(appfn: MaybeFn2, v1: &mut Value, v2: &mut Value) -> Self

impl Value

pub fn export_float(&self) -> Result<Vec<f64>, Box<dyn Error>>

impl Value

pub fn message_add_to<N: AsRef<str>>(&mut self, to: N) -> Self

pub fn message_add_payload(&mut self, data: Value) -> Self

impl Value

pub fn push(&mut self, value: Value) -> Self

impl Value

pub fn push_inplace(&mut self, value: Value) -> Result<&mut Value, Error>

impl Value

pub fn pull(&self) -> Self

impl Value

pub fn pop(&mut self) -> Option<Value>

impl Value

pub fn fmap(&mut self, appfn: AppFn) -> Self

pub fn map_float(&mut self, appfn: FloatFn) -> Self

impl Value

pub fn numeric_op(op: Ops, x: Value, y: Value) -> Result<Value, Box<dyn Error>>

impl Value

pub fn freduce(&mut self, appfn: AppFn2, value1: Value) -> Self

impl Value

pub fn len(&self) -> usize

impl Value

pub fn lambda() -> Self

pub fn to_lambda(value: Vec<Value>) -> Self

impl Value

pub fn regen_id(&mut self) -> Self

impl Value

pub fn to_json(&self) -> Result<String, Error>

pub fn from_json(data: String) -> Result<Value, Error>

impl Value

pub fn set<N: AsRef<str> + Display>(&mut self, key: N, value: Value) -> Self

pub fn set_vmap(&mut self, key: Value, value: Value) -> Self

pub fn set_key_raw<N: AsRef<str> + Display>( &mut self, key: N, value: Value, ) -> Self

impl Value

pub fn get<N: AsRef<str> + Display>( &self, key: N, ) -> Result<Self, Box<dyn Error>>

impl Value

pub fn has_key<N: AsRef<str> + Display>( &self, key: N, ) -> Result<Self, Box<dyn Error>>

pub fn has_key_raw<N: AsRef<str> + Display>( &self, key: N, ) -> Result<bool, Box<dyn Error>>

impl Value

pub fn set_tag<N: AsRef<str> + Display>(&mut self, key: N, value: N)

pub fn get_tag<N: AsRef<str> + Display>(&mut self, key: N) -> Option<String>

pub fn has_tag<N: AsRef<str> + Display>(&mut self, key: N) -> bool

impl Value

pub fn get_timestamp(&self) -> f64

pub fn get_timestamp_as_datetime(&self) -> DateTime<Utc>

pub fn timestamp_diff(&self, other: Self) -> f64

pub fn elapsed(&self) -> Result<u128, Box<dyn Error>>

pub fn elapsed_value(&self) -> Result<Self, Box<dyn Error>>

pub fn get_time_as_datetime(&self) -> Result<DateTime<Utc>, Box<dyn Error>>

impl Value

pub fn new() -> Self

impl Value

pub fn type_of(&self) -> u16

pub fn type_name(&self) -> &'static str

impl Value

pub fn tensor(&mut self) -> Result<Tensor, Error>

Trait Implementations

impl Add for Value

type Output = Value

The resulting type after applying the + operator.

fn add(self, other: Self) -> Self

Performs the + operation.

impl Clone for Value

fn clone(&self) -> Value

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Value

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Value

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Value

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

Formats the value using the given formatter.

impl Div for Value

type Output = Value

The resulting type after applying the / operator.

fn div(self, other: Self) -> Self

Performs the / operation.

impl Eq for Value

impl Hash for Value

fn hash<H: Hasher>(&self, hasher: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Iterator for Value

type Item = Value

The type of the elements being iterated over.

fn next(&mut self) -> Option<Value>

Advances the iterator and returns the next value.

fn next_chunk<const N: usize>( &mut self, ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

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

Advances the iterator and returns an array containing the next N values.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

where Self: Sized,

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

where Self: Sized,

Consumes the iterator, returning the last element.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

Advances the iterator by n elements.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse(self, separator: Self::Item) -> Intersperse<Self>

where Self: Sized, Self::Item: Clone,

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

Creates a new iterator which places a copy of separator between items of the original iterator.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

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

Creates a new iterator which places an item generated by separator between items of the original iterator.

fn map<B, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F)

where Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

fn skip(self, n: usize) -> Skip<Self>

where Self: Sized,

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure.

fn flatten(self) -> Flatten<Self>

where Self: Sized, Self::Item: IntoIterator,

Creates an iterator that flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

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

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Creates a “by reference” adapter for this instance of Iterator.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

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

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Item) -> bool,

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

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R

where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn fold<B, F>(self, init: B, f: F) -> B

where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

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

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

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

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index.

fn max(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: Copy + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: Clone + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn cycle(self) -> Cycle<Self>

where Self: Sized + Clone,

Repeats an iterator endlessly.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

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

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements.

fn cmp<I>(self, other: I) -> Ordering

where I: IntoIterator<Item = Self::Item>, Self::Item: Ord, Self: Sized,

Lexicographically compares the elements of this Iterator with those of another.

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

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

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering>

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

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

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another.

fn eq_by<I, F>(self, other: I, eq: F) -> bool

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

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

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another.

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted(self) -> bool

where Self: Sized, Self::Item: PartialOrd,

Checks if the elements of this iterator are sorted.

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

Checks if the elements of this iterator are sorted using the given key extraction function.

impl Mul for Value

type Output = Value

The resulting type after applying the * operator.

fn mul(self, other: Self) -> Self

Performs the * operation.

impl Ord for Value

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Value

fn eq(&self, other: &Self) -> 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 PartialOrd for Value

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Self) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Self) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Self) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Self) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for Value

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Sub for Value

type Output = Value

The resulting type after applying the - operator.

fn sub(self, other: Self) -> Self

Performs the - operation.