object StrictZipper
Contains implicit definitions to build instances of the StrictZipper typeclass
Author:
Harshad Deo
- Since
0.1
- Alphabetic
- By Inheritance
- StrictZipper
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
implicit
def
strictZipper2[M[_] <: Traversable[_], X, Y, THL <: HList](implicit tr0: TransformConstraint[:+:[M[X], :+:[M[Y], HNil]], THL, M, Traversable], tr1: ~>[M, Traversable], tr2: TransformConstraint[THL, THL, Traversable, Traversable], tr3: DownTransformConstraint[THL, :+:[X, :+:[Y, HNil]], Traversable], ex: ForeachConstraint[THL, Traversable[_]], evn: NotContained[M[_], :+:[Stream[_], HNil]]): StrictZipper[:+:[M[X], :+:[M[Y], HNil]], M, :+:[X, :+:[Y, HNil]], THL]
Base case for StrictZipper
Base case for StrictZipper
Author:
Harshad Deo
- M
Common context of the elements of the HList
- X
Context free type of the head
- Y
Context free type of the head of the tail
- THL
Result of applying M ~> Traversable to M[X] :+: M[Y] :+: HNil
- Since
0.1
-
implicit
def
strictZipperN[M[_] <: Traversable[_], X, TL <: HList, FTL <: HList, THL <: HList](implicit ev: StrictZipper[TL, M, FTL, _], tr0: TransformConstraint[:+:[M[X], TL], THL, M, Traversable], tr1: ~>[M, Traversable], tr2: TransformConstraint[THL, THL, Traversable, Traversable], tr3: DownTransformConstraint[THL, :+:[X, FTL], Traversable], ex: ForeachConstraint[THL, Traversable[_]], evn: NotContained[M[_], :+:[Stream[_], HNil]]): StrictZipper[:+:[M[X], TL], M, :+:[X, FTL], THL]
Induction case for StrictZipper
Induction case for StrictZipper
Author:
Harshad Deo
- M
Common context of the elements of the HList
- X
Context free type of the head
- TL
Type of the tail of the input HList
- FTL
Downconverted type of the tail of the input HList. For details, see constraint.DownTransformConstraint
- THL
Result of applying M ~> Traversable to M[X] :+: TL
- Since
0.1
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )