/// <summary>
/// Adds the by step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> By <S, E>(this ISchemaBoundTraversal <S, E> traversal, string key)
{
return(traversal.AsGraphTraversal().By(key).AsSchemaBound());
}
/// <summary>
/// Adds the hasLabel step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> HasLabel <S, E>(this ISchemaBoundTraversal <S, E> traversal, string label, params string[] otherLabels)
{
return(traversal.AsGraphTraversal().HasLabel(label, otherLabels).AsSchemaBound());
}
/// <summary>
/// Adds the hasNot step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> HasNot <S, E>(this ISchemaBoundTraversal <S, E> traversal, string propertyKey)
{
return(traversal.AsGraphTraversal().HasNot(propertyKey).AsSchemaBound());
}
/// <summary>
/// Adds the has step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Has <S, E>(this ISchemaBoundTraversal <S, E> traversal, T accessor, P predicate)
{
return(traversal.AsGraphTraversal().Has(accessor, predicate).AsSchemaBound());
}
/// <summary>
/// Adds the hasId step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> HasId <S, E>(this ISchemaBoundTraversal <S, E> traversal, object id, params object[] otherIds)
{
return(traversal.AsGraphTraversal().HasId(id, otherIds).AsSchemaBound());
}
/// <summary>
/// Adds the has step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Has <S, E>(this ISchemaBoundTraversal <S, E> traversal, string propertyKey, object value)
{
return(traversal.AsGraphTraversal().Has(propertyKey, value).AsSchemaBound());
}
/// <summary>
/// Adds the has step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Has <S, E>(this ISchemaBoundTraversal <S, E> traversal, string propertyKey, ITraversal propertyTraversal)
{
return(traversal.AsGraphTraversal().Has(propertyKey, propertyTraversal).AsSchemaBound());
}
/// <summary>
/// Adds the cyclicPath step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> CyclicPath <S, E>(this ISchemaBoundTraversal <S, E> traversal)
{
return(traversal.AsGraphTraversal().CyclicPath().AsSchemaBound());
}
/// <summary>
/// Adds the dedup step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Dedup <S, E>(this ISchemaBoundTraversal <S, E> traversal, params string[] dedupLabels)
{
return(traversal.AsGraphTraversal().Dedup(dedupLabels).AsSchemaBound());
}
/// <summary>
/// Adds the count step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static GraphTraversal <S, long> Count <S, E>(this ISchemaBoundTraversal <S, E> traversal, Scope scope)
{
return(traversal.AsGraphTraversal().Count(scope));
}
/// <summary>
/// Adds the addE step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static GraphTraversal <S, Edge> AddE <S, E>(this ISchemaBoundTraversal <S, E> traversal, ITraversal edgeLabelTraversal)
{
return(traversal.AsGraphTraversal().AddE(edgeLabelTraversal));
}
/// <summary>
/// Adds the coin step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Coin <S, E>(this ISchemaBoundTraversal <S, E> traversal, double probability)
{
return(traversal.AsGraphTraversal().Coin(probability).AsSchemaBound());
}
/// <summary>
/// Adds the by step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> By <S, E>(this ISchemaBoundTraversal <S, E> traversal, ITraversal byTraversal, IComparator comparator)
{
return(traversal.AsGraphTraversal().By(byTraversal, comparator).AsSchemaBound());
}
/// <summary>
/// Adds the by step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> By <S, E>(this ISchemaBoundTraversal <S, E> traversal, T token)
{
return(traversal.AsGraphTraversal().By(token).AsSchemaBound());
}
/// <summary>
/// Adds the from step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> From <S, E>(this ISchemaBoundTraversal <S, E> traversal, Vertex fromVertex)
{
return(traversal.AsGraphTraversal().From(fromVertex).AsSchemaBound());
}
/// <summary>
/// Adds the drop step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Drop <S, E>(this ISchemaBoundTraversal <S, E> traversal)
{
return(traversal.AsGraphTraversal().Drop().AsSchemaBound());
}
/// <summary>
/// Adds the groupCount step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> GroupCount <S, E>(this ISchemaBoundTraversal <S, E> traversal, string sideEffectKey)
{
return(traversal.AsGraphTraversal().GroupCount(sideEffectKey).AsSchemaBound());
}
/// <summary>
/// Adds the emit step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Emit <S, E>(this ISchemaBoundTraversal <S, E> traversal, P emitPredicate)
{
return(traversal.AsGraphTraversal().Emit(emitPredicate).AsSchemaBound());
}
/// <summary>
/// Adds the has step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Has <S, E>(this ISchemaBoundTraversal <S, E> traversal, string label, string propertyKey, P predicate)
{
return(traversal.AsGraphTraversal().Has(label, propertyKey, predicate).AsSchemaBound());
}
/// <summary>
/// Adds the emit step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Emit <S, E>(this ISchemaBoundTraversal <S, E> traversal, ITraversal emitTraversal)
{
return(traversal.AsGraphTraversal().Emit(emitTraversal).AsSchemaBound());
}
/// <summary>
/// Adds the has step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Has <S, E>(this ISchemaBoundTraversal <S, E> traversal, T accessor, object value)
{
return(traversal.AsGraphTraversal().Has(accessor, value).AsSchemaBound());
}
/// <summary>
/// Adds the filter step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Filter <S, E>(this ISchemaBoundTraversal <S, E> traversal, P predicate)
{
return(traversal.AsGraphTraversal().Filter(predicate).AsSchemaBound());
}
/// <summary>
/// Adds the has step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Has <S, E>(this ISchemaBoundTraversal <S, E> traversal, T accessor, ITraversal propertyTraversal)
{
return(traversal.AsGraphTraversal().Has(accessor, propertyTraversal).AsSchemaBound());
}
/// <summary>
/// Adds the filter step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> Filter <S, E>(this ISchemaBoundTraversal <S, E> traversal, ITraversal filterTraversal)
{
return(traversal.AsGraphTraversal().Filter(filterTraversal).AsSchemaBound());
}
/// <summary>
/// Adds the hasLabel step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> HasLabel <S, E>(this ISchemaBoundTraversal <S, E> traversal, P predicate)
{
return(traversal.AsGraphTraversal().HasLabel(predicate).AsSchemaBound());
}
/// <summary>
/// Adds the fold step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static GraphTraversal <S, IList <E> > Fold <S, E>(this ISchemaBoundTraversal <S, E> traversal)
{
return(traversal.AsGraphTraversal().Fold());
}
/// <summary>
/// Adds the addV step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static GraphTraversal <S, Vertex> AddV <S, E>(this ISchemaBoundTraversal <S, E> traversal, ITraversal vertexLabelTraversal)
{
return(traversal.AsGraphTraversal().AddV(vertexLabelTraversal));
}
/// <summary>
/// Adds the from step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> From <S, E>(this ISchemaBoundTraversal <S, E> traversal, string fromStepLabel)
{
return(traversal.AsGraphTraversal().From(fromStepLabel).AsSchemaBound());
}
/// <summary>
/// Adds the hasValue step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> HasValue <S, E>(this ISchemaBoundTraversal <S, E> traversal, object value, params object[] otherValues)
{
return(traversal.AsGraphTraversal().HasValue(value, otherValues).AsSchemaBound());
}
/// <summary>
/// Adds the by step to this <see cref="GraphTraversal{SType, EType}"/>.
/// </summary>
public static ISchemaBoundTraversal <S, E> By <S, E>(this ISchemaBoundTraversal <S, E> traversal, Order order)
{
return(traversal.AsGraphTraversal().By(order).AsSchemaBound());
}