Struct GraphMap 

pub struct GraphMap(pub HashMap<String, GraphValue>);

Map typed as returned by RETURN {a: 1}

Tuple Fields

0: HashMap<String, GraphValue>

Implementations

impl GraphMap

pub fn into_inner(self) -> HashMap<String, GraphValue>

Take ownership of the underlying HashMap

pub fn get<T: FromGraphValue>(&self, key: &str) -> RedisResult<Option<T>>

Gets a value by its key and converts it to a given return type

Trait Implementations

impl Clone for GraphMap

fn clone(&self) -> GraphMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphMap

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

Formats the value using the given formatter.

impl FromGraphValue for GraphMap

fn from_graph_value(value: GraphValue) -> RedisResult<Self>

Converts the GraphValue to the implementing Type

impl FromRedisValue for GraphMap

fn from_redis_value(v: &Value) -> RedisResult<Self>

Given a redis Value this attempts to convert it into the given destination type. If that fails because it’s not compatible an appropriate error is generated.

fn from_redis_values(items: &[Value]) -> Result<Vec<Self>, RedisError>

Similar to from_redis_value but constructs a vector of objects from another vector of values. This primarily exists internally to customize the behavior for vectors of tuples.

impl PartialEq for GraphMap

fn eq(&self, other: &GraphMap) -> 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 StructuralPartialEq for GraphMap