Type Members
-
type
Aux[DomainType, Labels <: HList, GraphTypeOut, StepsTypeOut] = Constructor[DomainType, Labels] { ... /* 2 definitions in type refinement */ }
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
forDomainNode[DomainType <: DomainRoot, Labels <: HList, StepsTypeOut <: NodeSteps[DomainType, Labels]](constr: (GremlinScala[Vertex]) ⇒ StepsTypeOut): Constructor[DomainType, Labels] { ... /* 2 definitions in type refinement */ }
-
implicit
def
forGeneric[T, Repr <: HList, GraphTypeHList <: HList, GraphTypeTuple <: Product, Labels <: HList, StepsType0 <: StepsRoot, EndDomainHList <: HList, EndDomainTuple <: Product](implicit gen: shapeless.Generic.Aux[T, Repr], constr: Aux[Repr, Labels, GraphTypeHList, StepsType0], graphTypeTupler: shapeless.ops.hlist.Tupler.Aux[GraphTypeHList, GraphTypeTuple], eq: =:=[LowestPriorityConstructorImplicits.forGeneric.StepsType0.EndDomain0, EndDomainHList], tupler: shapeless.ops.hlist.Tupler.Aux[EndDomainHList, EndDomainTuple], converter: Converter.Aux[T, GraphTypeTuple]): Constructor[T, Labels] { ... /* 2 definitions in type refinement */ }
-
implicit
def
forHList[H, HGraphType, Labels <: HList, HStepsType, T <: HList, TGraphType <: HList, TStepsType](implicit hConstr: Aux[H, Labels, HGraphType, HStepsType], tConstr: Aux[T, Labels, TGraphType, TStepsType], converter: Converter.Aux[::[H, T], ::[HGraphType, TGraphType]]): Constructor[::[H, T], Labels] { ... /* 2 definitions in type refinement */ }
-
implicit
val
forHNil: Constructor[HNil, HNil] { ... /* 2 definitions in type refinement */ }
-
implicit
def
forList[A, AGraphType, Labels <: HList, AStepsType](implicit aConverter: Converter.Aux[A, AGraphType]): Constructor[List[A], Labels] { ... /* 2 definitions in type refinement */ }
-
implicit
def
forSet[A, AGraphType, Labels <: HList, AStepsType](implicit aConverter: Converter.Aux[A, AGraphType]): Constructor[Set[A], Labels] { ... /* 2 definitions in type refinement */ }
-
implicit
def
forSimpleType[A, Labels <: HList](implicit converter: Converter.Aux[A, A]): Constructor[A, Labels] { ... /* 2 definitions in type refinement */ }
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any