object ScalazArbitrary extends ScalazArbitraryPlatform
Instances of scalacheck.Arbitrary
for many types in Scalaz.
- Source
- ScalazArbitrary.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ScalazArbitrary
- ScalazArbitraryPlatform
- ScalazArbitrary1
- AnyRef
- Any
- Hide All
- Show All
Visibility
- 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
- implicit val AlphaArbitrary: Arbitrary[Alpha]
-
implicit
def
Arbitrary_==>>[A, B](implicit o: Order[A], A: Arbitrary[A], B: Arbitrary[B]): Arbitrary[==>>[A, B]]
- Since
7.1.0
- implicit def Arbitrary_ISet[A](implicit o: Order[A], A: Arbitrary[A]): Arbitrary[ISet[A]]
- implicit def Arbitrary_Maybe[A](implicit arg0: Arbitrary[A]): Arbitrary[Maybe[A]]
- implicit val BigIntMultiplicationArbitrary: Arbitrary[@@[BigInt, Multiplication]]
- implicit val BigIntegerMultiplicationArbitrary: Arbitrary[@@[BigInteger, Multiplication]]
- implicit val BooleanConjunctionArbitrary: Arbitrary[@@[Boolean, Conjunction]]
- implicit val ByteMultiplicationArbitrary: Arbitrary[@@[Byte, Multiplication]]
- implicit def CallableArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Callable[A]]
- implicit def CaseInsensitiveArbitrary[A](implicit A0: Arbitrary[A], A1: FoldCase[A]): Arbitrary[CaseInsensitive[A]]
- implicit val CharMultiplicationArbitrary: Arbitrary[@@[Char, Multiplication]]
- implicit def CokleisliArbitrary[M[_], A, B](implicit a: Arbitrary[(M[A]) ⇒ B]): Arbitrary[Cokleisli[M, A, B]]
- implicit def CoproductArbitrary[F[_], G[_], A](implicit a: Arbitrary[\/[F[A], G[A]]]): Arbitrary[Coproduct[F, G, A]]
- implicit def CorecursiveListArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[CorecursiveList[A]]
- implicit val DigitArbitrary: Arbitrary[Digit]
- implicit def DisjunctionArbitrary[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[\/[A, B]]
- implicit val DoubleMultiplicationArbitrary: Arbitrary[@@[Double, Multiplication]]
- implicit def EitherFirstLeftProjectionArbitrary[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[@@[LeftProjection[A, B], First]]
- implicit def EitherFirstRightProjectionArbitrary[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[@@[RightProjection[A, B], First]]
- implicit def EitherLastLeftProjectionArbitrary[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[@@[LeftProjection[A, B], Last]]
- implicit def EitherLastRightProjectionArbitrary[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[@@[RightProjection[A, B], Last]]
- implicit def EitherLeftProjectionArbitrary[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[LeftProjection[A, B]]
- implicit def EitherRightProjectionArbitrary[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[RightProjection[A, B]]
- implicit def EphemeralStreamArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[EphemeralStream[A]]
- implicit def FingerArbitrary[V, A](implicit a: Arbitrary[A], measure: Reducer[A, V]): Arbitrary[Finger[V, A]]
- implicit def FingerTreeArbitrary[V, A](implicit a: Arbitrary[A], measure: Reducer[A, V]): Arbitrary[FingerTree[V, A]]
- implicit def FirstMaybeArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[@@[Maybe[A], First]]
- implicit def FirstOptionArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[@@[Option[A], First]]
- implicit val FloatMultiplicationArbitrary: Arbitrary[@@[Float, Multiplication]]
- implicit def Function0Arbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[() ⇒ A]
-
implicit
def
FutureArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Future[A]]
- Definition Classes
- ScalazArbitraryPlatform
- implicit def ImmutableArrayArbitrary[A](implicit arg0: Arbitrary[A], arg1: ClassTag[A]): Arbitrary[ImmutableArray[A]]
- implicit def IndSeqArbibrary[A](implicit arg0: Arbitrary[A]): Arbitrary[IndSeq[A]]
- implicit val IntDualArbitrary: Arbitrary[@@[Int, Tags.Dual]]
- implicit val IntMultiplicationArbitrary: Arbitrary[@@[Int, Multiplication]]
- implicit def IterableArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Iterable[A]]
- implicit def KleisliArbitrary[M[_], A, B](implicit a: Arbitrary[(A) ⇒ M[B]]): Arbitrary[Kleisli[M, A, B]]
- implicit def LastMaybeArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[@@[Maybe[A], Last]]
- implicit def LastOptionArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[@@[Option[A], Last]]
- implicit val LongMultiplicationArbitrary: Arbitrary[@@[Long, Multiplication]]
- implicit def MaxMaybeArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[MaxMaybe[A]]
- implicit def MaxOptionArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[MaxOption[A]]
- implicit def MinMaybeArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[MinMaybe[A]]
- implicit def MinOptionArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[MinOption[A]]
- implicit def NameArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Name[A]]
- implicit def NeedArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Need[A]]
- implicit def NodeArbitrary[V, A](implicit a: Arbitrary[A], measure: Reducer[A, V]): Arbitrary[Node[V, A]]
- implicit def NonEmptyListArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[NonEmptyList[A]]
-
implicit
def
OneAndArbitrary[F[_], A](implicit A: Arbitrary[A], FA: Arbitrary[F[A]]): Arbitrary[OneAnd[F, A]]
- Since
7.0.3
-
implicit
def
OneOrArbitrary[F[_], A](implicit A: Arbitrary[A], FA: Arbitrary[F[A]]): Arbitrary[OneOr[F, A]]
- Since
7.0.3
- implicit val OrderingArbitrary: Arbitrary[Ordering]
- implicit val ShortMultiplicationArbitrary: Arbitrary[@@[Short, Multiplication]]
- implicit def StrictTreeArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[StrictTree[A]]
-
implicit
def
TaskArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Task[A]]
- Definition Classes
- ScalazArbitraryPlatform
- implicit def TreeArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Tree[A]]
- implicit def TreeLocArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[TreeLoc[A]]
- implicit def Tuple1Arbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[(A)]
- implicit val UnitArbitrary: Arbitrary[Unit]
- implicit def ValidationArbitrary[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[Validation[A, B]]
- implicit def ValueArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Value[A]]
- implicit def ZipperArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Zipper[A]]
- implicit def alterArbitrary[F[_], A](implicit F: Arbitrary[F[A]]): Arbitrary[Alter[F, A]]
- implicit def apArbitrary[F[_], A](implicit F: Arbitrary[F[A]]): Arbitrary[Ap[F, A]]
- implicit val arbBigInt: Arbitrary[BigInt]
- implicit val arbBigInteger: Arbitrary[BigInteger]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
implicit
def
cogenAlter[F[_], A](implicit F: Cogen[F[A]]): Cogen[Alter[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenAp[F[_], A](implicit F: Cogen[F[A]]): Cogen[Ap[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenCokleisli[F[_], A, B](implicit F: Cogen[(F[A]) ⇒ B]): Cogen[Cokleisli[F, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenConst[A, B](implicit A: Cogen[A]): Cogen[Const[A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenContravariantCoyoneda[F[_], A](implicit arg0: Contravariant[F], F: Cogen[F[A]]): Cogen[ContravariantCoyoneda[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenCoproduct[F[_], G[_], A](implicit A: Cogen[\/[F[A], G[A]]]): Cogen[Coproduct[F, G, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenCoyoneda[F[_], A](implicit arg0: Functor[F], F: Cogen[F[A]]): Cogen[Coyoneda[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenDList[A](implicit arg0: Cogen[A]): Cogen[DList[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenDequeue[A](implicit arg0: Cogen[A]): Cogen[Dequeue[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenDiev[A](implicit arg0: Cogen[A]): Cogen[Diev[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenDisjunction[A, B](implicit A: Cogen[A], B: Cogen[B]): Cogen[\/[A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenEither3[A1, A2, A3](implicit arg0: Cogen[A1], arg1: Cogen[A2], arg2: Cogen[A3]): Cogen[Either3[A1, A2, A3]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenEitherT[F[_], A, B](implicit F: Cogen[F[\/[A, B]]]): Cogen[EitherT[F, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenEndo[A](implicit A: Cogen[(A) ⇒ A]): Cogen[Endo[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenEndomorphic[F[_, _], A](implicit F: Cogen[F[A, A]]): Cogen[Endomorphic[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenEphemeralStream[A](implicit arg0: Cogen[A]): Cogen[EphemeralStream[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenHeap[A](implicit arg0: Cogen[A]): Cogen[Heap[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenIList[A](implicit arg0: Cogen[A]): Cogen[IList[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenIMap[A, B](implicit arg0: Cogen[A], arg1: Cogen[B]): Cogen[==>>[A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenISet[A](implicit arg0: Cogen[A]): Cogen[ISet[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenIdT[F[_], A](implicit F: Cogen[F[A]]): Cogen[IdT[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenImmutableArray[A](implicit arg0: Cogen[A]): Cogen[ImmutableArray[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenIndSeq[A](implicit arg0: Cogen[A]): Cogen[IndSeq[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenIndexedContsT[W[_], M[_], R, O, A](implicit F: Cogen[(W[(A) ⇒ M[O]]) ⇒ M[R]]): Cogen[IndexedContsT[W, M, R, O, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenIndexedReaderWriterStateT[F[_], R, W, S1, S2, A](implicit arg0: Monad[F], F: Cogen[(R, S1) ⇒ F[(W, A, S2)]]): Cogen[IndexedReaderWriterStateT[F, R, W, S1, S2, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenIndexedStateT[F[_], S1, S2, A](implicit arg0: Monad[F], F: Cogen[(S1) ⇒ F[(S2, A)]]): Cogen[IndexedStateT[F, S1, S2, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenIndexedStoreT[F[_], I, A, B](implicit arg0: Cogen[I], F: Cogen[F[(A) ⇒ B]]): Cogen[IndexedStoreT[F, I, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenKleisli[F[_], A, B](implicit F: Cogen[(A) ⇒ F[B]]): Cogen[Kleisli[F, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenLazyEither[A, B](implicit arg0: Cogen[A], arg1: Cogen[B]): Cogen[LazyEither[A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenLazyEitherT[F[_], A, B](implicit F: Cogen[F[LazyEither[A, B]]]): Cogen[LazyEitherT[F, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenLazyOption[A](implicit arg0: Cogen[A]): Cogen[LazyOption[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenLazyOptionT[F[_], A](implicit F: Cogen[F[LazyOption[A]]]): Cogen[LazyOptionT[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenLazyTuple2[A1, A2](implicit arg0: Cogen[A1], arg1: Cogen[A2]): Cogen[LazyTuple2[A1, A2]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenLazyTuple3[A1, A2, A3](implicit arg0: Cogen[A1], arg1: Cogen[A2], arg2: Cogen[A3]): Cogen[LazyTuple3[A1, A2, A3]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenLazyTuple4[A1, A2, A3, A4](implicit arg0: Cogen[A1], arg1: Cogen[A2], arg2: Cogen[A3], arg3: Cogen[A4]): Cogen[LazyTuple4[A1, A2, A3, A4]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenMaybe[A](implicit arg0: Cogen[A]): Cogen[Maybe[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenMaybeT[F[_], A](implicit F: Cogen[F[Maybe[A]]]): Cogen[MaybeT[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenName[A](implicit A: Cogen[A]): Cogen[Name[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenNeed[A](implicit A: Cogen[A]): Cogen[Need[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenNonEmptyList[A](implicit arg0: Cogen[A]): Cogen[NonEmptyList[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenNullArgument[A, B](implicit F: Cogen[(Option[A]) ⇒ B]): Cogen[NullArgument[A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenNullResult[A, B](implicit F: Cogen[(A) ⇒ Option[B]]): Cogen[NullResult[A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenOneAnd[F[_], A](implicit arg0: Cogen[A], F: Cogen[F[A]]): Cogen[OneAnd[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenOneOr[F[_], A](implicit arg0: Cogen[A], F: Cogen[F[A]]): Cogen[OneOr[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenOptionT[F[_], A](implicit F: Cogen[F[Option[A]]]): Cogen[OptionT[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
val
cogenOrdering: Cogen[Ordering]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenStreamT[F[_], A](implicit arg0: Monad[F], F: Cogen[F[Stream[A]]]): Cogen[StreamT[F, A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenStrictTree[A](implicit arg0: Cogen[A]): Cogen[StrictTree[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenTannen[F[_], G[_, _], A, B](implicit F: Cogen[F[G[A, B]]]): Cogen[Tannen[F, G, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenThese[A, B](implicit A: Cogen[A], B: Cogen[B]): Cogen[\&/[A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenTheseT[F[_], A, B](implicit F: Cogen[F[\&/[A, B]]]): Cogen[TheseT[F, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenTracedT[W[_], A, B](implicit W: Cogen[W[(A) ⇒ B]]): Cogen[TracedT[W, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenTree[A](implicit arg0: Cogen[A]): Cogen[Tree[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenTreeLoc[A](implicit arg0: Cogen[A]): Cogen[TreeLoc[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenUnwriterT[F[_], A, B](implicit F: Cogen[F[(A, B)]]): Cogen[UnwriterT[F, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenValidation[A, B](implicit arg0: Cogen[A], arg1: Cogen[B]): Cogen[Validation[A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenValue[A](implicit A: Cogen[A]): Cogen[Value[A]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenWriterT[F[_], A, B](implicit F: Cogen[F[(A, B)]]): Cogen[WriterT[F, A, B]]
- Definition Classes
- ScalazArbitrary1
-
implicit
def
cogenZipper[A](implicit A: Cogen[A]): Cogen[Zipper[A]]
- Definition Classes
- ScalazArbitrary1
- implicit def constArbitrary[A, B](implicit arg0: Arbitrary[A]): Arbitrary[Const[A, B]]
- implicit def dequeueArbitrary[A](implicit A: Arbitrary[List[A]]): Arbitrary[Dequeue[A]]
- implicit def dievArbitrary[A](implicit A: Arbitrary[List[A]], E: Enum[A]): Arbitrary[Diev[A]]
- implicit def dlistArbitrary[A](implicit A: Arbitrary[List[A]]): Arbitrary[DList[A]]
- implicit def eitherTArb[F[_], A, B](implicit A: Arbitrary[F[\/[A, B]]]): Arbitrary[EitherT[F, A, B]]
- implicit def endoArb[A](implicit A: Arbitrary[(A) ⇒ A]): Arbitrary[Endo[A]]
- implicit def endomorphicArbitrary[F[_, _], A](implicit F: Arbitrary[F[A, A]]): Arbitrary[Endomorphic[F, A]]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- implicit def heapArbitrary[A](implicit O: Order[A], A: Arbitrary[List[A]]): Arbitrary[Heap[A]]
- implicit def idTArbitrary[A, F[_]](implicit A: Arbitrary[F[A]]): Arbitrary[IdT[F, A]]
- implicit def ilistArbitrary[A](implicit A: Arbitrary[List[A]]): Arbitrary[IList[A]]
- implicit def indexedContsTArb[W[_], M[_], R, O, A](implicit A: Arbitrary[(W[(A) ⇒ M[O]]) ⇒ M[R]]): Arbitrary[IndexedContsT[W, M, R, O, A]]
- implicit def indexedReaderWriterStateTArb[F[_], R, W, S1, S2, A](implicit A: Arbitrary[(R, S1) ⇒ F[(W, A, S2)]]): Arbitrary[IndexedReaderWriterStateT[F, R, W, S1, S2, A]]
- implicit def indexedStateTArb[F[_], S1, S2, A](implicit A: Arbitrary[(S1) ⇒ F[(S2, A)]], F: Monad[F]): Arbitrary[IndexedStateT[F, S1, S2, A]]
- implicit def indexedStoreTArb[F[_], I, A, B](implicit A: Arbitrary[(F[(A) ⇒ B], I)]): Arbitrary[IndexedStoreT[F, I, A, B]]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- implicit def iterateeInputArbitrary[A](implicit arg0: Arbitrary[A]): Arbitrary[Input[A]]
- implicit def lazyEitherArb[F[_], A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[LazyEither[A, B]]
- implicit def lazyEitherTArb[F[_], A, B](implicit A: Arbitrary[F[LazyEither[A, B]]]): Arbitrary[LazyEitherT[F, A, B]]
- implicit def lazyOptionArb[F[_], A](implicit A: Arbitrary[Option[A]]): Arbitrary[LazyOption[A]]
- implicit def lazyOptionTArb[F[_], A](implicit A: Arbitrary[F[LazyOption[A]]]): Arbitrary[LazyOptionT[F, A]]
- implicit def lazyTuple2Arbitrary[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[LazyTuple2[A, B]]
- implicit def lazyTuple3Arbitrary[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C]): Arbitrary[LazyTuple3[A, B, C]]
- implicit def lazyTuple4Arbitrary[A, B, C, D](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], arg3: Arbitrary[D]): Arbitrary[LazyTuple4[A, B, C, D]]
- implicit def listTArb[F[_], A](implicit FA: Arbitrary[F[List[A]]], F: Applicative[F]): Arbitrary[ListT[F, A]]
- implicit def maybeTArb[F[_], A](implicit A: Arbitrary[F[Maybe[A]]]): Arbitrary[MaybeT[F, A]]
- implicit def monoidCoproductArbitrary[M, N](implicit arg0: Arbitrary[M], arg1: Arbitrary[N]): Arbitrary[:+:[M, N]]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- implicit def optionTArb[F[_], A](implicit A: Arbitrary[F[Option[A]]]): Arbitrary[OptionT[F, A]]
- implicit def parallelArbitrary[A](implicit A: Arbitrary[A]): Arbitrary[@@[A, Parallel]]
- def stateTArb[F[+_], S, A](implicit A: Arbitrary[(S) ⇒ F[(S, A)]], F: Monad[F]): Arbitrary[StateT[F, S, A]]
- def storeTArb[F[+_], A, B](implicit A: Arbitrary[(F[(A) ⇒ B], A)]): Arbitrary[StoreT[F, A, B]]
- implicit def streamTArb[F[_], A](implicit FA: Arbitrary[F[Stream[A]]], F: Applicative[F]): Arbitrary[StreamT[F, A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- implicit def tannenArbitrary[F[_], G[_, _], A, B](implicit F: Arbitrary[F[G[A, B]]]): Arbitrary[Tannen[F, G, A, B]]
-
implicit
def
theseArb[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B]): Arbitrary[\&/[A, B]]
- Since
7.0.3
- implicit def theseTArb[F[_], A, B](implicit A: Arbitrary[F[\&/[A, B]]]): Arbitrary[TheseT[F, A, B]]
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- implicit def tracedTArb[W[_], A, B](implicit A: Arbitrary[W[(A) ⇒ B]]): Arbitrary[TracedT[W, A, B]]
- implicit def unwriterTArb[F[_], U, A](implicit A: Arbitrary[F[(U, A)]]): Arbitrary[UnwriterT[F, U, A]]
-
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( ... ) @native()
- implicit def writerTArb[F[_], W, A](implicit A: Arbitrary[F[(W, A)]]): Arbitrary[WriterT[F, W, A]]