Data update
This commit is contained in:
parent
5150844a7d
commit
4bb20c9b71
7735 changed files with 38060 additions and 199180 deletions
|
|
@ -1,9 +0,0 @@
|
|||
with Ada.Text_IO;
|
||||
procedure Integers is
|
||||
Value : Integer := 1;
|
||||
begin
|
||||
loop
|
||||
Ada.Text_IO.Put_Line (Integer'Image (Value));
|
||||
Value := Value + 1; -- raises exception Constraint_Error on overflow
|
||||
end loop;
|
||||
end Integers;
|
||||
|
|
@ -1,7 +0,0 @@
|
|||
with Ada.Text_IO;
|
||||
procedure Positives is
|
||||
begin
|
||||
for Value in Positive'Range loop
|
||||
Ada.Text_IO.Put_Line (Positive'Image (Value));
|
||||
end loop;
|
||||
end Positives;
|
||||
|
|
@ -1,16 +0,0 @@
|
|||
IDENTIFICATION DIVISION.
|
||||
PROGRAM-ID. Int-Sequence.
|
||||
|
||||
DATA DIVISION.
|
||||
WORKING-STORAGE SECTION.
|
||||
* *> 36 digits is the largest size a numeric field can have.
|
||||
01 I PIC 9(36).
|
||||
|
||||
PROCEDURE DIVISION.
|
||||
* *> Display numbers until I overflows.
|
||||
PERFORM VARYING I FROM 1 BY 1 UNTIL I = 0
|
||||
DISPLAY I
|
||||
END-PERFORM
|
||||
|
||||
GOBACK
|
||||
.
|
||||
|
|
@ -1,10 +1,10 @@
|
|||
max = pow 2 53
|
||||
repeat
|
||||
print i
|
||||
if i = 10
|
||||
if i = 5
|
||||
print "."
|
||||
print "."
|
||||
i = max - 10
|
||||
i = max - 6
|
||||
.
|
||||
until i = max
|
||||
i += 1
|
||||
|
|
|
|||
|
|
@ -1,11 +1,11 @@
|
|||
import extensions;
|
||||
|
||||
public program()
|
||||
public Program()
|
||||
{
|
||||
var i := 0u;
|
||||
while (true)
|
||||
{
|
||||
console.printLine(i);
|
||||
Console.printLine(i);
|
||||
|
||||
i += 1u
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,2 +0,0 @@
|
|||
(dotimes (i most-positive-fixnum)
|
||||
(message "%d" (1+ i)))
|
||||
|
|
@ -1,6 +0,0 @@
|
|||
integer i
|
||||
i = 0
|
||||
while 1 do
|
||||
? i
|
||||
i += 1
|
||||
end while
|
||||
|
|
@ -2,7 +2,7 @@ import java.math.BigInteger
|
|||
|
||||
fun main() {
|
||||
// Using a 64-bit unsigned type, print until 18446744073709551615
|
||||
(1u..ULong.MAX_VALUE).forEach { println(it) }
|
||||
(1uL..ULong.MAX_VALUE).forEach { println(it) }
|
||||
|
||||
// Using unlimited-size integers, print forever
|
||||
var n = BigInteger.ONE
|
||||
|
|
|
|||
|
|
@ -1,8 +0,0 @@
|
|||
try
|
||||
{
|
||||
for ([int]$i = 0;;$i++)
|
||||
{
|
||||
$i
|
||||
}
|
||||
}
|
||||
catch {break}
|
||||
Loading…
Add table
Add a link
Reference in a new issue