Abstract Value Members
-
implicit abstract
def
F: TimeSeries[F]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
collectConsistentWithMapFilter[A, B](fa: F[A], f: PartialFunction[A, B]): IsEq[F[B]]
-
def
collectFirstSome_Ref[A, B](fa: F[A], f: (A) ⇒ Option[B]): IsEq[Option[B]]
-
def
collectFirst_Ref[A, B](fa: F[A], pf: PartialFunction[A, B]): IsEq[Option[B]]
-
def
commutativeCombineK[A](fa: F[A], fb: F[A]): IsEq[F[A]]
-
def
covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]
-
def
covariantIdentity[A](fa: F[A]): IsEq[F[A]]
-
def
dropWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
-
-
-
def
existsConsistentWithFind[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
-
def
existsLazy[A](fa: F[A]): Boolean
-
def
filterConsistentWithMapFilter[A](fa: F[A], f: (A) ⇒ Boolean): IsEq[F[A]]
-
def
filter_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
-
def
finalize(): Unit
-
def
flattenOptionConsistentWithMapFilter[A](fa: F[Option[A]]): IsEq[F[A]]
-
def
foldMIdentity[A, B](fa: F[A], b: B, f: (B, A) ⇒ B): IsEq[B]
-
def
foldMapDerived[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Monoid[B]): IsEq[B]
-
def
foldRef[A](fa: F[A])(implicit A: Monoid[A]): IsEq[A]
-
def
foldRightLazy[A](fa: F[A]): Boolean
-
def
forallConsistentWithExists[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
-
def
forallEmpty[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
-
def
forallLazy[A](fa: F[A]): Boolean
-
def
fromConsistency[A, G[_]](ga: G[(A, Instant)])(implicit arg0: Foldable[G]): IsEq[List[A]]
-
implicit
def
functor: Functor[F]
-
final
def
getClass(): Class[_]
-
def
getRef[A](fa: F[A], idx: Long): IsEq[Option[A]]
-
def
groupByTimeIdentity[A](fa: F[A]): IsEq[F[NonEmptyList[A]]]
-
def
groupByTimeSequence[A](fa: F[A], periodInSecondsSeed: Long): IsEq[List[A]]
-
def
hashCode(): Int
-
def
innerJoinWithDuplication[A, B](fa: F[A], f: (A, A) ⇒ B): IsEq[F[B]]
-
def
innerJoinWithLeftOnly[A, B](fa: F[A], f: (A, A) ⇒ B): IsEq[F[B]]
-
def
innerJoinWithRightOnly[A, B](fa: F[A], f: (A, A) ⇒ B): IsEq[F[B]]
-
def
invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]
-
def
invariantIdentity[A](fa: F[A]): IsEq[F[A]]
-
final
def
isInstanceOf[T0]: Boolean
-
def
lastConsistency[A, G[_]](ga: G[(A, Instant)])(implicit arg0: Foldable[G]): IsEq[Option[(A, Instant)]]
-
def
leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
-
def
mapFilterComposition[A, B, C](fa: F[A], f: (A) ⇒ Option[B], g: (B) ⇒ Option[C]): IsEq[F[C]]
-
def
mapFilterMapConsistency[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
-
def
mapWithIndexRef[A, B](fa: F[A], f: (A, Int) ⇒ B): IsEq[F[B]]
-
def
mapWithTimeConsistentWithMap[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
-
def
monoidKLeftIdentity[A](a: F[A]): IsEq[F[A]]
-
def
monoidKRightIdentity[A](a: F[A]): IsEq[F[A]]
-
-
def
nonEmptyRef[A](fa: F[A]): IsEq[Boolean]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
orderedConsistency[A](x: F[A], y: F[A])(implicit arg0: Eq[A], ev: Eq[F[A]]): IsEq[List[A]]
-
def
outerJoinConsistent[A, B](fa: F[A], fb: F[B]): IsEq[F[Ior[A, B]]]
-
def
reduceLeftOptionConsistentWithReduceLeftToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]
-
def
reduceRightOptionConsistentWithReduceRightToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]
-
def
rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
-
def
semigroupKAssociative[A](a: F[A], b: F[A], c: F[A]): IsEq[F[A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
takeWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
-
def
toListRef[A](fa: F[A]): IsEq[List[A]]
-
def
toString(): String
-
def
traverseIdentity[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
-
def
traverseOrderConsistent[A](fa: F[A]): IsEq[Option[A]]
-
def
traverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (A) ⇒ N[B])(implicit N: Applicative[N], M: Applicative[M]): IsEq[(M[F[B]], N[F[B]])]
-
def
traverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (B) ⇒ N[C])(implicit N: Applicative[N], M: Applicative[M]): IsEq[Nested[M, N, F[C]]]
-
def
traverseWithIndexMRef[G[_], A, B](fa: F[A], f: (A, Int) ⇒ G[B])(implicit G: Monad[G]): IsEq[G[F[B]]]
-
def
traverseWithTimeConsistentWithTraverse[A, B, G[_]](fa: F[A], f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): IsEq[G[F[B]]]
-
def
unorderedFoldConsistentWithUnorderedFoldMap[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): IsEq[A]
-
def
unorderedSequenceConsistent[A, G[_]](fga: F[G[A]])(implicit arg0: CommutativeApplicative[G]): IsEq[G[F[A]]]
-
def
unorderedTraverseIdentity[A, B](fa: F[A])(f: (A) ⇒ B)(implicit ev: Functor[F]): IsEq[F[B]]
-
def
unorderedTraverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (A) ⇒ N[B])(implicit N: CommutativeApplicative[N], M: CommutativeApplicative[M]): IsEq[(M[F[B]], N[F[B]])]
-
def
unorderedTraverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (B) ⇒ N[C])(implicit N: CommutativeApplicative[N], M: CommutativeApplicative[M]): IsEq[Nested[M, N, F[C]]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zipWithIndexRef[A, B](fa: F[A], f: ((A, Int)) ⇒ B): IsEq[F[B]]
