-
Notifications
You must be signed in to change notification settings - Fork 803
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
05a8ab4
commit f41a178
Showing
25 changed files
with
10,005 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
59 changes: 59 additions & 0 deletions
59
tests/FSharp.Compiler.ComponentTests/EmittedIL/ForLoop/ForLoopBigInt.fs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,59 @@ | ||
let mutable c = 0I | ||
|
||
module Up = | ||
let constEmpty () = | ||
for n = 10I to 1I do | ||
c <- n | ||
|
||
let constNonEmpty () = | ||
for n = 1I to 10I do | ||
c <- n | ||
|
||
let constFinish start = | ||
for n = start to 10I do | ||
c <- n | ||
|
||
let constStart finish = | ||
for n = 1I to finish do | ||
c <- n | ||
|
||
let annotatedStart (start: bigint) finish = | ||
for n = start to finish do | ||
c <- n | ||
|
||
let annotatedFinish start (finish: bigint) = | ||
for n = start to finish do | ||
c <- n | ||
|
||
let inferredStartAndFinish start finish = | ||
for n = start to finish do | ||
c <- n | ||
|
||
module Down = | ||
let constEmpty () = | ||
for n = 1I downto 10I do | ||
c <- n | ||
|
||
let constNonEmpty () = | ||
for n = 10I downto 1I do | ||
c <- n | ||
|
||
let constFinish start = | ||
for n = start downto 1I do | ||
c <- n | ||
|
||
let constStart finish = | ||
for n = 10I downto finish do | ||
c <- n | ||
|
||
let annotatedStart (start: bigint) finish = | ||
for n = start downto finish do | ||
c <- n | ||
|
||
let annotatedFinish start (finish: bigint) = | ||
for n = start downto finish do | ||
c <- n | ||
|
||
let inferredStartAndFinish start finish = | ||
for n = start downto finish do | ||
c <- n |
Oops, something went wrong.