Documentation
Init
.
Data
.
Range
.
Polymorphic
.
Int
Search
return to top
source
Imports
Init.Omega
Init.Data.Int.Order
Init.Data.Range.Polymorphic.Instances
Imported by
Std
.
PRange
.
instUpwardEnumerableInt
Std
.
PRange
.
instLawfulUpwardEnumerableInt
Std
.
PRange
.
instInfinitelyUpwardEnumerableInt
Std
.
PRange
.
instLawfulUpwardEnumerableLEInt
Std
.
PRange
.
instLawfulUpwardEnumerableLTInt
Std
.
PRange
.
instLawfulUpwardEnumerableLTInt_1
Std
.
PRange
.
instHasSizeInt
Std
.
PRange
.
instLawfulHasSizeInt
Std
.
PRange
.
instIsAlwaysFiniteInt
Std
.
PRange
.
instHasSizeInt_1
Std
.
PRange
.
instLawfulHasSizeInt_1
Std
.
PRange
.
instIsAlwaysFiniteInt_1
source
instance
Std
.
PRange
.
instUpwardEnumerableInt
:
UpwardEnumerable
Int
Equations
Std.PRange.instUpwardEnumerableInt
=
{
succ?
:=
fun (
x
:
Int
) =>
some
(
x
+
1
)
,
succMany?
:=
fun (
n
:
Nat
) (
x
:
Int
) =>
some
(
x
+
↑
n
)
}
source
instance
Std
.
PRange
.
instLawfulUpwardEnumerableInt
:
LawfulUpwardEnumerable
Int
source
instance
Std
.
PRange
.
instInfinitelyUpwardEnumerableInt
:
InfinitelyUpwardEnumerable
Int
source
instance
Std
.
PRange
.
instLawfulUpwardEnumerableLEInt
:
LawfulUpwardEnumerableLE
Int
source
instance
Std
.
PRange
.
instLawfulUpwardEnumerableLTInt
:
LawfulUpwardEnumerableLT
Int
source
instance
Std
.
PRange
.
instLawfulUpwardEnumerableLTInt_1
:
LawfulUpwardEnumerableLT
Int
source
instance
Std
.
PRange
.
instHasSizeInt
:
Rxc.HasSize
Int
Equations
Std.PRange.instHasSizeInt
=
{
size
:=
fun (
lo
hi
:
Int
) =>
(
hi
+
1
-
lo
).
toNat
}
source
instance
Std
.
PRange
.
instLawfulHasSizeInt
:
Rxc.LawfulHasSize
Int
source
instance
Std
.
PRange
.
instIsAlwaysFiniteInt
:
Rxc.IsAlwaysFinite
Int
source
instance
Std
.
PRange
.
instHasSizeInt_1
:
Rxo.HasSize
Int
Equations
Std.PRange.instHasSizeInt_1
=
Std.Rxo.HasSize.ofClosed
source
instance
Std
.
PRange
.
instLawfulHasSizeInt_1
:
Rxo.LawfulHasSize
Int
source
instance
Std
.
PRange
.
instIsAlwaysFiniteInt_1
:
Rxo.IsAlwaysFinite
Int