tempus
.
timeSeries
.
laws
.
discipline
TimeSeriesTests
Related Docs:
object TimeSeriesTests
|
package discipline
trait
TimeSeriesTests
[
F
[
_
]
]
extends
MonoidKTests
[
F
] with
TraverseTests
[
F
] with
FunctorFilterTests
[
F
]
Linear Supertypes
FunctorFilterTests
[
F
],
TraverseTests
[
F
],
UnorderedTraverseTests
[
F
],
FoldableTests
[
F
],
UnorderedFoldableTests
[
F
],
FunctorTests
[
F
],
InvariantTests
[
F
],
MonoidKTests
[
F
],
SemigroupKTests
[
F
],
Laws
,
AnyRef
,
Any
Ordering
Alphabetic
By Inheritance
Inherited
TimeSeriesTests
FunctorFilterTests
TraverseTests
UnorderedTraverseTests
FoldableTests
UnorderedFoldableTests
FunctorTests
InvariantTests
MonoidKTests
SemigroupKTests
Laws
AnyRef
Any
Hide All
Show All
Visibility
Public
All
Type Members
class
DefaultRuleSet
extends
RuleSet
with
HasOneParent
Definition Classes
Laws
trait
HasOneParent
extends
AnyRef
Definition Classes
Laws
trait
RuleSet
extends
AnyRef
Definition Classes
Laws
class
SimpleRuleSet
extends
DefaultRuleSet
Definition Classes
Laws
Abstract Value Members
abstract
def
laws
:
TimeSeriesLaws
[
F
]
Definition Classes
TimeSeriesTests
→ FunctorFilterTests → TraverseTests → UnorderedTraverseTests → FoldableTests → UnorderedFoldableTests → FunctorTests → InvariantTests → MonoidKTests → SemigroupKTests
Concrete 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
(
...
)
def
emptyRuleSet
:
RuleSet
Definition Classes
Laws
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]
)
def
foldable
[
A
,
B
]
(
implicit
arg0:
Arbitrary
[
A
]
,
arg1:
Arbitrary
[
B
]
,
ArbFA:
Arbitrary
[
F
[
A
]]
,
A:
CommutativeMonoid
[
A
]
,
B:
CommutativeMonoid
[
B
]
,
CogenA:
Cogen
[
A
]
,
CogenB:
Cogen
[
B
]
,
EqA:
Eq
[
A
]
,
EqFA:
Eq
[
F
[
A
]]
,
EqB:
Eq
[
B
]
,
EqOptionB:
Eq
[
Option
[
B
]]
,
EqOptionA:
Eq
[
Option
[
A
]]
)
:
RuleSet
Definition Classes
FoldableTests
def
functor
[
A
,
B
,
C
]
(
implicit
arg0:
Arbitrary
[
A
]
,
arg1:
Arbitrary
[
B
]
,
arg2:
Arbitrary
[
C
]
,
ArbFA:
Arbitrary
[
F
[
A
]]
,
CogenA:
Cogen
[
A
]
,
CogenB:
Cogen
[
B
]
,
CogenC:
Cogen
[
C
]
,
EqFA:
Eq
[
F
[
A
]]
,
EqFC:
Eq
[
F
[
C
]]
)
:
RuleSet
Definition Classes
FunctorTests
def
functorFilter
[
A
,
B
,
C
]
(
implicit
ArbFA:
Arbitrary
[
F
[
A
]]
,
ArbFABoo:
Arbitrary
[
PartialFunction
[
A
,
B
]]
,
ArbFOA:
Arbitrary
[
F
[
Option
[
A
]]]
,
ArbAOB:
Arbitrary
[(
A
) ⇒
Option
[
B
]]
,
ArbBOC:
Arbitrary
[(
B
) ⇒
Option
[
C
]]
,
ArbAB:
Arbitrary
[(
A
) ⇒
B
]
,
ArbABoo:
Arbitrary
[(
A
) ⇒
Boolean
]
,
EqFA:
Eq
[
F
[
A
]]
,
EqFB:
Eq
[
F
[
B
]]
,
EqFC:
Eq
[
F
[
C
]]
)
:
RuleSet
Definition Classes
FunctorFilterTests
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
def
invariant
[
A
,
B
,
C
]
(
implicit
arg0:
Arbitrary
[
A
]
,
arg1:
Arbitrary
[
B
]
,
arg2:
Arbitrary
[
C
]
,
ArbFA:
Arbitrary
[
F
[
A
]]
,
CogenA:
Cogen
[
A
]
,
CogenB:
Cogen
[
B
]
,
CogenC:
Cogen
[
C
]
,
EqFA:
Eq
[
F
[
A
]]
,
EqFC:
Eq
[
F
[
C
]]
)
:
RuleSet
Definition Classes
InvariantTests
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
monoidK
[
A
]
(
implicit
arg0:
Arbitrary
[
A
]
,
ArbFA:
Arbitrary
[
F
[
A
]]
,
EqFA:
Eq
[
F
[
A
]]
)
:
RuleSet
Definition Classes
MonoidKTests
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
semigroupK
[
A
]
(
implicit
arg0:
Arbitrary
[
A
]
,
ArbFA:
Arbitrary
[
F
[
A
]]
,
EqFA:
Eq
[
F
[
A
]]
)
:
RuleSet
Definition Classes
SemigroupKTests
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
timeSeries
[
A
,
B
,
C
,
M
,
X
[
_
]
,
Y
[
_
]
,
Z
[
_
]
]
(
implicit
arg0:
Arbitrary
[
A
]
,
arg1:
Arbitrary
[
B
]
,
arg2:
Arbitrary
[
C
]
,
arg3:
Arbitrary
[
M
]
,
arg4:
CommutativeApplicative
[
X
]
,
arg5:
CommutativeApplicative
[
Y
]
,
arg6:
Foldable
[
Z
]
,
ArbFA:
Arbitrary
[
F
[
A
]]
,
ArbFOptionA:
Arbitrary
[
F
[
Option
[
A
]]]
,
ArbFB:
Arbitrary
[
F
[
B
]]
,
ArbXB:
Arbitrary
[
X
[
B
]]
,
ArbXM:
Arbitrary
[
X
[
M
]]
,
ArbYB:
Arbitrary
[
Y
[
B
]]
,
ArbYC:
Arbitrary
[
Y
[
C
]]
,
ArbYM:
Arbitrary
[
Y
[
M
]]
,
ArbZM:
Arbitrary
[
Z
[(
A
,
Instant
)]]
,
ArbFXM:
Arbitrary
[
F
[
X
[
M
]]]
,
CogenA:
Cogen
[
A
]
,
CogenB:
Cogen
[
B
]
,
CogenC:
Cogen
[
C
]
,
CogenM:
Cogen
[
M
]
,
M:
CommutativeMonoid
[
M
]
,
MA:
CommutativeMonoid
[
A
]
,
EqFA:
Eq
[
F
[
A
]]
,
EqFListA:
Eq
[
F
[
NonEmptyList
[
A
]]]
,
EqFIorA:
Eq
[
F
[
Ior
[
A
,
A
]]]
,
EqFIorB:
Eq
[
F
[
Ior
[
A
,
B
]]]
,
EqFB:
Eq
[
F
[
B
]]
,
EqFC:
Eq
[
F
[
C
]]
,
EqM:
Eq
[
M
]
,
EqA:
Eq
[
A
]
,
EqListA:
Eq
[
List
[
A
]]
,
EqXYFC:
Eq
[
X
[
Y
[
F
[
C
]]]]
,
EqXFB:
Eq
[
X
[
F
[
B
]]]
,
EqYFB:
Eq
[
Y
[
F
[
B
]]]
,
EqXFM:
Eq
[
X
[
F
[
M
]]]
,
EqYFM:
Eq
[
Y
[
F
[
M
]]]
,
EqOptionA:
Eq
[
Option
[
A
]]
)
:
RuleSet
def
toString
()
:
String
Definition Classes
AnyRef → Any
def
traverse
[
A
,
B
,
C
,
M
,
X
[
_
]
,
Y
[
_
]
]
(
implicit
arg0:
Arbitrary
[
A
]
,
arg1:
Arbitrary
[
B
]
,
arg2:
Arbitrary
[
C
]
,
arg3:
Arbitrary
[
M
]
,
arg4:
CommutativeApplicative
[
X
]
,
arg5:
CommutativeApplicative
[
Y
]
,
ArbFA:
Arbitrary
[
F
[
A
]]
,
ArbFB:
Arbitrary
[
F
[
B
]]
,
ArbXB:
Arbitrary
[
X
[
B
]]
,
ArbXM:
Arbitrary
[
X
[
M
]]
,
ArbYB:
Arbitrary
[
Y
[
B
]]
,
ArbYC:
Arbitrary
[
Y
[
C
]]
,
ArbYM:
Arbitrary
[
Y
[
M
]]
,
ArbFXM:
Arbitrary
[
F
[
X
[
M
]]]
,
CogenA:
Cogen
[
A
]
,
CogenB:
Cogen
[
B
]
,
CogenC:
Cogen
[
C
]
,
CogenM:
Cogen
[
M
]
,
M:
CommutativeMonoid
[
M
]
,
MA:
CommutativeMonoid
[
A
]
,
EqFA:
Eq
[
F
[
A
]]
,
EqFC:
Eq
[
F
[
C
]]
,
EqM:
Eq
[
M
]
,
EqA:
Eq
[
A
]
,
EqXYFC:
Eq
[
X
[
Y
[
F
[
C
]]]]
,
EqXFB:
Eq
[
X
[
F
[
B
]]]
,
EqYFB:
Eq
[
Y
[
F
[
B
]]]
,
EqXFM:
Eq
[
X
[
F
[
M
]]]
,
EqYFM:
Eq
[
Y
[
F
[
M
]]]
,
EqOptionA:
Eq
[
Option
[
A
]]
)
:
RuleSet
Definition Classes
TraverseTests
def
unorderedFoldable
[
A
,
B
]
(
implicit
arg0:
Arbitrary
[
A
]
,
arg1:
Arbitrary
[
B
]
,
ArbFA:
Arbitrary
[
F
[
A
]]
,
ArbF:
Arbitrary
[(
A
) ⇒
B
]
,
CogenA:
Cogen
[
A
]
,
A:
CommutativeMonoid
[
A
]
,
B:
CommutativeMonoid
[
B
]
,
EqFA:
Eq
[
A
]
,
EqFB:
Eq
[
B
]
)
:
RuleSet
Definition Classes
UnorderedFoldableTests
def
unorderedTraverse
[
A
,
B
,
C
,
X
[
_
]
,
Y
[
_
]
]
(
implicit
arg0:
Arbitrary
[
A
]
,
arg1:
Arbitrary
[
B
]
,
arg2:
Arbitrary
[
C
]
,
arg3:
CommutativeApplicative
[
X
]
,
arg4:
CommutativeApplicative
[
Y
]
,
ArbFA:
Arbitrary
[
F
[
A
]]
,
ArbFXB:
Arbitrary
[
F
[
X
[
B
]]]
,
ArbXB:
Arbitrary
[
X
[
B
]]
,
ArbYB:
Arbitrary
[
Y
[
B
]]
,
ArbYC:
Arbitrary
[
Y
[
C
]]
,
CogenA:
Cogen
[
A
]
,
CogenB:
Cogen
[
B
]
,
Ca:
CommutativeMonoid
[
A
]
,
Cb:
CommutativeMonoid
[
B
]
,
EqA:
Eq
[
A
]
,
EqB:
Eq
[
B
]
,
EqXYFC:
Eq
[
X
[
Y
[
F
[
C
]]]]
,
EqXFB:
Eq
[
X
[
F
[
B
]]]
,
EqYFB:
Eq
[
Y
[
F
[
B
]]]
)
:
RuleSet
Definition Classes
UnorderedTraverseTests
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
(
...
)
Inherited from
FunctorFilterTests
[
F
]
Inherited from
TraverseTests
[
F
]
Inherited from
UnorderedTraverseTests
[
F
]
Inherited from
FoldableTests
[
F
]
Inherited from
UnorderedFoldableTests
[
F
]
Inherited from
FunctorTests
[
F
]
Inherited from
InvariantTests
[
F
]
Inherited from
MonoidKTests
[
F
]
Inherited from
SemigroupKTests
[
F
]
Inherited from
Laws
Inherited from
AnyRef
Inherited from
Any
Ungrouped