Trait simd_json::prelude::Object

pub trait Object {
    type Key;
    type Element;

    // Required methods
    fn get<Q>(&self, k: &Q) -> Option<&Self::Element>
       where Self::Key: Borrow<Q> + Hash + Eq,
             Q: Hash + Eq + Ord + ?Sized;
    fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut Self::Element>
       where Self::Key: Borrow<Q> + Hash + Eq,
             Q: Hash + Eq + Ord + ?Sized;
    fn insert<K, V>(&mut self, k: K, v: V) -> Option<Self::Element>
       where K: Into<Self::Key>,
             V: Into<Self::Element>,
             Self::Key: Hash + Eq;
    fn remove<Q>(&mut self, k: &Q) -> Option<Self::Element>
       where Self::Key: Borrow<Q>,
             Q: Hash + Eq + Ord + ?Sized;
    fn iter<'i>(
        &'i self
    ) -> Box<dyn Iterator<Item = (&'i Self::Key, &'i Self::Element)> + 'i, Global>;
    fn keys<'i>(
        &'i self
    ) -> Box<dyn Iterator<Item = &'i Self::Key> + 'i, Global>;
    fn values<'i>(
        &'i self
    ) -> Box<dyn Iterator<Item = &'i Self::Element> + 'i, Global>;
    fn len(&self) -> usize;

    // Provided method
    fn is_empty(&self) -> bool { ... }
}

Prelude to include needed traits A JSON Object

Required Associated Types

type Key

The key in the objects

type Element

The values in the object

Required Methods

fn get<Q>(&self, k: &Q) -> Option<&Self::Element>where Self::Key: Borrow<Q> + Hash + Eq, Q: Hash + Eq + Ord + ?Sized,

Gets a ref to a value based on a key, returns None if the current Value isn’t an Object or doesn’t contain the key it was asked for.

fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut Self::Element>where Self::Key: Borrow<Q> + Hash + Eq, Q: Hash + Eq + Ord + ?Sized,

Gets the value of a key as a mutable reference.

fn insert<K, V>(&mut self, k: K, v: V) -> Option<Self::Element>where K: Into<Self::Key>, V: Into<Self::Element>, Self::Key: Hash + Eq,

Inserts a value

fn remove<Q>(&mut self, k: &Q) -> Option<Self::Element>where Self::Key: Borrow<Q>, Q: Hash + Eq + Ord + ?Sized,

Removes a value from the object

fn iter<'i>( &'i self ) -> Box<dyn Iterator<Item = (&'i Self::Key, &'i Self::Element)> + 'i, Global>

Iterates over the key value paris

fn keys<'i>(&'i self) -> Box<dyn Iterator<Item = &'i Self::Key> + 'i, Global>

Iterates over the keys

fn values<'i>( &'i self ) -> Box<dyn Iterator<Item = &'i Self::Element> + 'i, Global>

Iterates over the values

fn len(&self) -> usize

Number of key/value pairs

Provided Methods

fn is_empty(&self) -> bool

Returns if the array is empty

Implementations on Foreign Types

impl<MapK, MapE, S> Object for HashMap<MapK, MapE, S>where S: BuildHasher, MapK: Hash + Eq,

type Key = MapK

type Element = MapE

fn get<Q>(&self, k: &Q) -> Option<&<HashMap<MapK, MapE, S> as Object>::Element>where <HashMap<MapK, MapE, S> as Object>::Key: Borrow<Q> + Hash + Eq, Q: Hash + Eq + Ord + ?Sized,

fn get_mut<Q>( &mut self, k: &Q ) -> Option<&mut <HashMap<MapK, MapE, S> as Object>::Element>where <HashMap<MapK, MapE, S> as Object>::Key: Borrow<Q> + Hash + Eq, Q: Hash + Eq + Ord + ?Sized,

fn insert<K, V>( &mut self, k: K, v: V ) -> Option<<HashMap<MapK, MapE, S> as Object>::Element>where K: Into<<HashMap<MapK, MapE, S> as Object>::Key>, V: Into<<HashMap<MapK, MapE, S> as Object>::Element>, <HashMap<MapK, MapE, S> as Object>::Key: Hash + Eq,

fn remove<Q>( &mut self, k: &Q ) -> Option<<HashMap<MapK, MapE, S> as Object>::Element>where <HashMap<MapK, MapE, S> as Object>::Key: Borrow<Q> + Hash + Eq, Q: Hash + Eq + Ord + ?Sized,

fn iter<'i>( &'i self ) -> Box<dyn Iterator<Item = (&'i <HashMap<MapK, MapE, S> as Object>::Key, &'i <HashMap<MapK, MapE, S> as Object>::Element)> + 'i, Global>

fn keys<'i>( &'i self ) -> Box<dyn Iterator<Item = &'i <HashMap<MapK, MapE, S> as Object>::Key> + 'i, Global>

fn values<'i>( &'i self ) -> Box<dyn Iterator<Item = &'i <HashMap<MapK, MapE, S> as Object>::Element> + 'i, Global>

fn len(&self) -> usize

impl<MapK, MapE, S> Object for SizedHashMap<MapK, MapE, S, 32>where MapK: Hash + Eq, S: BuildHasher + Default,

type Key = MapK

type Element = MapE

fn get<Q>( &self, k: &Q ) -> Option<&<SizedHashMap<MapK, MapE, S, 32> as Object>::Element>where <SizedHashMap<MapK, MapE, S, 32> as Object>::Key: Borrow<Q> + Hash + Eq, Q: Hash + Eq + Ord + ?Sized,

fn get_mut<Q>( &mut self, k: &Q ) -> Option<&mut <SizedHashMap<MapK, MapE, S, 32> as Object>::Element>where <SizedHashMap<MapK, MapE, S, 32> as Object>::Key: Borrow<Q> + Hash + Eq, Q: Hash + Eq + Ord + ?Sized,

fn insert<K, V>( &mut self, k: K, v: V ) -> Option<<SizedHashMap<MapK, MapE, S, 32> as Object>::Element>where K: Into<<SizedHashMap<MapK, MapE, S, 32> as Object>::Key>, V: Into<<SizedHashMap<MapK, MapE, S, 32> as Object>::Element>, <SizedHashMap<MapK, MapE, S, 32> as Object>::Key: Hash + Eq,

fn remove<Q>( &mut self, k: &Q ) -> Option<<SizedHashMap<MapK, MapE, S, 32> as Object>::Element>where <SizedHashMap<MapK, MapE, S, 32> as Object>::Key: Borrow<Q> + Hash + Eq, Q: Hash + Eq + Ord + ?Sized,

fn iter<'i>( &'i self ) -> Box<dyn Iterator<Item = (&'i <SizedHashMap<MapK, MapE, S, 32> as Object>::Key, &'i <SizedHashMap<MapK, MapE, S, 32> as Object>::Element)> + 'i, Global>

fn keys<'i>( &'i self ) -> Box<dyn Iterator<Item = &'i <SizedHashMap<MapK, MapE, S, 32> as Object>::Key> + 'i, Global>

fn values<'i>( &'i self ) -> Box<dyn Iterator<Item = &'i <SizedHashMap<MapK, MapE, S, 32> as Object>::Element> + 'i, Global>

fn len(&self) -> usize

Implementors