gremlin-client 0.2.2

A Rust client for Apache TinkerPop™
Documentation
use crate::structure::GValue;
use crate::structure::{Either2, TextP, T};
use crate::structure::{IntoPredicate, P};

pub enum HasStepKey {
    Str(String),
    T(T),
}

impl Into<HasStepKey> for T {
    fn into(self) -> HasStepKey {
        HasStepKey::T(self)
    }
}

impl Into<HasStepKey> for String {
    fn into(self) -> HasStepKey {
        HasStepKey::Str(self)
    }
}

impl Into<HasStepKey> for &str {
    fn into(self) -> HasStepKey {
        HasStepKey::Str(String::from(self))
    }
}

pub struct HasStep {
    label: Option<String>,
    key: HasStepKey,
    predicate: Option<Either2<P, TextP>>,
}

impl HasStep {
    pub fn take_params(self) -> Vec<GValue> {
        let mut params: Vec<GValue> = vec![];

        if let Some(s) = self.label {
            params.push(Into::into(s));
        }

        match self.key {
            HasStepKey::Str(key) => params.push(Into::into(key)),
            HasStepKey::T(key) => params.push(Into::into(key)),
        };

        if let Some(p) = self.predicate {
            params.push(Into::into(p));
        }

        params
    }
}

pub trait IntoHasStep {
    fn into_step(self) -> HasStep;
}

impl<A, B> IntoHasStep for (A, B)
where
    A: Into<HasStepKey>,
    B: IntoPredicate,
{
    fn into_step(self) -> HasStep {
        HasStep {
            label: None,
            key: self.0.into(),
            predicate: Some(self.1.into_predicate()),
        }
    }
}

impl<A, B, C> IntoHasStep for (A, B, C)
where
    A: Into<String>,
    B: Into<HasStepKey>,
    C: IntoPredicate,
{
    fn into_step(self) -> HasStep {
        HasStep {
            label: Some(self.0.into()),
            key: self.1.into(),
            predicate: Some(self.2.into_predicate()),
        }
    }
}

impl IntoHasStep for (String) {
    fn into_step(self) -> HasStep {
        HasStep {
            label: None,
            key: HasStepKey::Str(self),
            predicate: None,
        }
    }
}

impl IntoHasStep for (&str) {
    fn into_step(self) -> HasStep {
        HasStep {
            label: None,
            key: HasStepKey::Str(String::from(self)),
            predicate: None,
        }
    }
}