Struct dsntk_feel::context::FeelContext

pub struct FeelContext(/* private fields */);

The FEEL context.

Implementations

impl FeelContext

pub fn new() -> Self

Creates a new, empty context.

pub fn contains_entry(&self, name: &Name) -> bool

Returns true if context contains an entry specified by name.

pub fn contains_entries(&self, qname: &QualifiedName) -> bool

Returns true if this FeelContext contains an entry specified by QualifiedName.

pub fn get_entry(&self, name: &Name) -> Option<&Value>

Returns a value of an entry with specified name.

pub fn set_entry(&mut self, name: &Name, value: Value)

Sets a value for specified entry name.

pub fn remove_entry(&mut self, name: &Name) -> Option<Value>

Removes a value of an entry with specified name.

pub fn set_null(&mut self, name: Name)

Sets a null value for specified entry.

pub fn get_entries(&self) -> Vec<(&Name, &Value)>

Returns a list of all FeelContext entries.

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

Returns an iterator over all entries in FeelContext.

pub fn get_first(&self) -> Option<&Value>

Returns a first value contained by context.

pub fn len(&self) -> usize

Returns the number of entries in FeelContext.

pub fn is_empty(&self) -> bool

Returns true if FeelContext is empty.

pub fn is_context(&self, name: &Name) -> bool

Returns true if FeelContext contains an entry with specified name, and the value is context.

pub fn zip(&mut self, other: &FeelContext)

pub fn overwrite(&mut self, other: &FeelContext)

pub fn move_entry(&mut self, name: Name, parent: Name)

pub fn create_entry(&mut self, qname: &QualifiedName, value: Value)

Creates an entry with a value for specified QualifiedName. All non existing intermediary contexts will be created.

pub fn search_entry<'a>(&'a self, qname: &'a QualifiedName) -> Option<&'a Value>

Searches for a value of an entry pointed by specified qualified name.

pub fn contains_deep(&self, names: &[Name]) -> bool

Deep check for a value pointed by slice of names.

pub fn create_entries(&mut self, names: &[Name], value: Value)

Creates entries with intermediary contexts when needed.

pub fn apply_entries(&mut self, names: &[Name], value: Value) -> Result<()>

???

pub fn search_deep(&self, names: &[Name]) -> Option<&Value>

Deep search for a value pointed by names.

Methods from Deref<Target = BTreeMap<Name, Value>>

pub fn get<Q>(&self, key: &Q) -> Option<&V>

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns a reference to the value corresponding to the key.

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

Examples

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(1, "a");
assert_eq!(map.get(&1), Some(&"a"));
assert_eq!(map.get(&2), None);

pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns the key-value pair corresponding to the supplied key.

The supplied key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

Examples

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(1, "a");
assert_eq!(map.get_key_value(&1), Some((&1, &"a")));
assert_eq!(map.get_key_value(&2), None);

pub fn first_key_value(&self) -> Option<(&K, &V)>

where K: Ord,

Returns the first key-value pair in the map. The key in this pair is the minimum key in the map.

Examples

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
assert_eq!(map.first_key_value(), None);
map.insert(1, "b");
map.insert(2, "a");
assert_eq!(map.first_key_value(), Some((&1, &"b")));

pub fn last_key_value(&self) -> Option<(&K, &V)>

where K: Ord,

Returns the last key-value pair in the map. The key in this pair is the maximum key in the map.

Examples

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(1, "b");
map.insert(2, "a");
assert_eq!(map.last_key_value(), Some((&2, &"a")));

pub fn contains_key<Q>(&self, key: &Q) -> bool

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns true if the map contains a value for the specified key.

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

Examples

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(1, "a");
assert_eq!(map.contains_key(&1), true);
assert_eq!(map.contains_key(&2), false);

pub fn range<T, R>(&self, range: R) -> Range<'_, K, V>

where T: Ord + ?Sized, K: Borrow<T> + Ord, R: RangeBounds<T>,

Constructs a double-ended iterator over a sub-range of elements in the map. The simplest way is to use the range syntax min..max, thus range(min..max) will yield elements from min (inclusive) to max (exclusive). The range may also be entered as (Bound<T>, Bound<T>), so for example range((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive range from 4 to 10.

Panics

Panics if range start > end. Panics if range start == end and both bounds are Excluded.

Examples

use std::collections::BTreeMap;
use std::ops::Bound::Included;

let mut map = BTreeMap::new();
map.insert(3, "a");
map.insert(5, "b");
map.insert(8, "c");
for (&key, &value) in map.range((Included(&4), Included(&8))) {
    println!("{key}: {value}");
}
assert_eq!(Some((&5, &"b")), map.range(4..).next());

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

Gets an iterator over the entries of the map, sorted by key.

Examples

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(3, "c");
map.insert(2, "b");
map.insert(1, "a");

for (key, value) in map.iter() {
    println!("{key}: {value}");
}

let (first_key, first_value) = map.iter().next().unwrap();
assert_eq!((*first_key, *first_value), (1, "a"));

pub fn keys(&self) -> Keys<'_, K, V>

Gets an iterator over the keys of the map, in sorted order.

Examples

use std::collections::BTreeMap;

let mut a = BTreeMap::new();
a.insert(2, "b");
a.insert(1, "a");

let keys: Vec<_> = a.keys().cloned().collect();
assert_eq!(keys, [1, 2]);

pub fn values(&self) -> Values<'_, K, V>

Gets an iterator over the values of the map, in order by key.

Examples

use std::collections::BTreeMap;

let mut a = BTreeMap::new();
a.insert(1, "hello");
a.insert(2, "goodbye");

let values: Vec<&str> = a.values().cloned().collect();
assert_eq!(values, ["hello", "goodbye"]);

pub fn len(&self) -> usize

Returns the number of elements in the map.

Examples

use std::collections::BTreeMap;

let mut a = BTreeMap::new();
assert_eq!(a.len(), 0);
a.insert(1, "a");
assert_eq!(a.len(), 1);

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

Examples

use std::collections::BTreeMap;

let mut a = BTreeMap::new();
assert!(a.is_empty());
a.insert(1, "a");
assert!(!a.is_empty());

pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>

where K: Borrow<Q> + Ord, Q: Ord,

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

Returns a Cursor pointing at the first element that is above the given bound.

If no such element exists then a cursor pointing at the “ghost” non-element is returned.

Passing Bound::Unbounded will return a cursor pointing at the first element of the map.

Examples

#![feature(btree_cursors)]

use std::collections::BTreeMap;
use std::ops::Bound;

let mut a = BTreeMap::new();
a.insert(1, "a");
a.insert(2, "b");
a.insert(3, "c");
a.insert(4, "c");
let cursor = a.lower_bound(Bound::Included(&2));
assert_eq!(cursor.key(), Some(&2));
let cursor = a.lower_bound(Bound::Excluded(&2));
assert_eq!(cursor.key(), Some(&3));

pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>

where K: Borrow<Q> + Ord, Q: Ord,

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

Returns a Cursor pointing at the last element that is below the given bound.

If no such element exists then a cursor pointing at the “ghost” non-element is returned.

Passing Bound::Unbounded will return a cursor pointing at the last element of the map.

Examples

#![feature(btree_cursors)]

use std::collections::BTreeMap;
use std::ops::Bound;

let mut a = BTreeMap::new();
a.insert(1, "a");
a.insert(2, "b");
a.insert(3, "c");
a.insert(4, "c");
let cursor = a.upper_bound(Bound::Included(&3));
assert_eq!(cursor.key(), Some(&3));
let cursor = a.upper_bound(Bound::Excluded(&3));
assert_eq!(cursor.key(), Some(&2));

Trait Implementations

impl Clone for FeelContext

fn clone(&self) -> FeelContext

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for FeelContext

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

Formats the value using the given formatter.

impl Default for FeelContext

fn default() -> FeelContext

Returns the “default value” for a type.

impl Deref for FeelContext

type Target = BTreeMap<Name, Value>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl Display for FeelContext

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

Convert FeelContext to string.

impl From<FeelContext> for FeelScope

fn from(ctx: FeelContext) -> Self

Creates a FeelScope from FeelContext.

impl From<FeelContext> for Value

fn from(ctx: FeelContext) -> Self

Converts FeelContext to Value.

impl Jsonify for FeelContext

fn jsonify(&self) -> String

Converts FeelContext to JSON string.

impl PartialEq for FeelContext

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl ToFeelString for FeelContext

fn to_feel_string(&self) -> String

Converts FeelContext to FEEL string.

impl TryFrom<Value> for FeelContext

fn try_from(value: Value) -> Result<Self, Self::Error>

Converts Value to FeelContext.

type Error = DsntkError

The type returned in the event of a conversion error.

impl StructuralPartialEq for FeelContext