Struct script::dom::bindings::record::Record

pub struct Record<K: RecordKey, V> {
    map: IndexMap<K, V>,
}

The Record (open-ended dictionary) type.

Fields

map: IndexMap<K, V>

Implementations

impl<K: RecordKey, V> Record<K, V>

pub fn new() -> Self

Create an empty Record.

Methods from Deref<Target = IndexMap<K, V>>

pub fn capacity(&self) -> usize

Computes in O(1) time.

pub fn hasher(&self) -> &S

Return a reference to the map’s BuildHasher.

pub fn len(&self) -> usize

Return the number of key-value pairs in the map.

Computes in O(1) time.

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

Computes in O(1) time.

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

Return an iterator over the key-value pairs of the map, in their order

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

Return an iterator over the keys of the map, in their order

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

Return an iterator over the values of the map, in their order

pub fn contains_key<Q>(&self, key: &Q) -> boolwhere
    Q: Hash + Equivalent<K> + ?Sized,

Return true if an equivalent to key exists in the map.

Computes in O(1) time (average).

pub fn get<Q>(&self, key: &Q) -> Option<&V>where
    Q: Hash + Equivalent<K> + ?Sized,

Return a reference to the value stored for key, if it is present, else None.

Computes in O(1) time (average).

pub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &V)>where
    Q: Hash + Equivalent<K> + ?Sized,

Return references to the key-value pair stored for key, if it is present, else None.

Computes in O(1) time (average).

pub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)>where
    Q: Hash + Equivalent<K> + ?Sized,

Return item index, key and value

pub fn get_index_of<Q>(&self, key: &Q) -> Option<usize>where
    Q: Hash + Equivalent<K> + ?Sized,

Return item index, if it exists in the map

pub fn get_index(&self, index: usize) -> Option<(&K, &V)>

Get a key-value pair by index

Valid indices are 0 <= index < self.len()

Computes in O(1) time.

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

Get the first key-value pair

Computes in O(1) time.

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

Get the last key-value pair

Computes in O(1) time.

Trait Implementations

impl<K: Clone + RecordKey, V: Clone> Clone for Record<K, V>

fn clone(&self) -> Record<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: RecordKey, V> Deref for Record<K, V>

type Target = IndexMap<K, V, RandomState>

The resulting type after dereferencing.

fn deref(&self) -> &IndexMap<K, V>

Dereferences the value.

impl<K, V, C> FromJSValConvertible for Record<K, V>where
    K: RecordKey,
    V: FromJSValConvertible<Config = C>,
    C: Clone,

type Config = C

Optional configurable behaviour switch; use () for no configuration.

unsafe fn from_jsval(
    cx: *mut JSContext,
    value: HandleValue<'_>,
    config: C
) -> Result<ConversionResult<Self>, ()>

Convert val to type Self. Optional configuration of type T can be passed as the option argument. If it returns Err(()), a JSAPI exception is pending. If it returns Ok(Failure(reason)), there is no pending JSAPI exception.

impl<K, V> JSTraceable for Record<K, V>where
    K: JSTraceable + RecordKey,
    V: JSTraceable,

unsafe fn trace(&self, tracer: *mut JSTracer)

Trace self.

impl<K, V> ToJSValConvertible for Record<K, V>where
    K: RecordKey,
    V: ToJSValConvertible,

unsafe fn to_jsval(&self, cx: *mut JSContext, rval: MutableHandleValue<'_>)

Convert self to a JSVal. JSAPI failure causes a panic.