langs a-z
This commit is contained in:
parent
db842d013d
commit
d066446780
11389 changed files with 98361 additions and 1020 deletions
10
Task/Integer-sequence/NetRexx/integer-sequence-1.netrexx
Normal file
10
Task/Integer-sequence/NetRexx/integer-sequence-1.netrexx
Normal file
|
|
@ -0,0 +1,10 @@
|
|||
/* NetRexx */
|
||||
options replace format comments java crossref symbols binary
|
||||
|
||||
k_ = Rexx
|
||||
bigDigits = 999999999 -- Maximum setting for digits allowed by NetRexx
|
||||
numeric digits bigDigits
|
||||
|
||||
loop k_ = 1
|
||||
say k_
|
||||
end k_
|
||||
15
Task/Integer-sequence/NetRexx/integer-sequence-2.netrexx
Normal file
15
Task/Integer-sequence/NetRexx/integer-sequence-2.netrexx
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
/* NetRexx */
|
||||
options replace format comments java crossref symbols binary
|
||||
|
||||
import java.math.BigInteger
|
||||
|
||||
-- allow an option to change the output radix.
|
||||
parse arg radix .
|
||||
if radix.length() == 0 then radix = 10 -- default to decimal
|
||||
k_ = BigInteger
|
||||
k_ = BigInteger.ZERO
|
||||
|
||||
loop forever
|
||||
k_ = k_.add(BigInteger.ONE)
|
||||
say k_.toString(int radix)
|
||||
end
|
||||
4
Task/Integer-sequence/Nimrod/integer-sequence.nimrod
Normal file
4
Task/Integer-sequence/Nimrod/integer-sequence.nimrod
Normal file
|
|
@ -0,0 +1,4 @@
|
|||
var i:int64 = 0
|
||||
while true:
|
||||
i = i + 1
|
||||
echo(i)
|
||||
7
Task/Integer-sequence/OCaml/integer-sequence-1.ocaml
Normal file
7
Task/Integer-sequence/OCaml/integer-sequence-1.ocaml
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
let () =
|
||||
let i = ref 0 in
|
||||
while true do
|
||||
print_int !i;
|
||||
print_newline ();
|
||||
incr i;
|
||||
done
|
||||
7
Task/Integer-sequence/OCaml/integer-sequence-2.ocaml
Normal file
7
Task/Integer-sequence/OCaml/integer-sequence-2.ocaml
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
let () =
|
||||
let rec aux i =
|
||||
print_int i;
|
||||
print_newline ();
|
||||
aux (succ i)
|
||||
in
|
||||
aux 0
|
||||
11
Task/Integer-sequence/Objeck/integer-sequence.objeck
Normal file
11
Task/Integer-sequence/Objeck/integer-sequence.objeck
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
bundle Default {
|
||||
class Count {
|
||||
function : Main(args : String[]) ~ Nil {
|
||||
i := 0;
|
||||
do {
|
||||
i->PrintLine();
|
||||
i += 1;
|
||||
} while(i <> 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,6 @@
|
|||
DEF VAR ii AS INTEGER FORMAT "->>>>>>>>9" NO-UNDO.
|
||||
|
||||
DO WHILE TRUE:
|
||||
ii = ii + 1.
|
||||
DISPLAY ii.
|
||||
END.
|
||||
|
|
@ -0,0 +1,6 @@
|
|||
DEF VAR ii AS INT64 FORMAT "->>>>>>>>>>>>>>>>>>9" NO-UNDO.
|
||||
|
||||
DO WHILE TRUE:
|
||||
ii = ii + 1.
|
||||
DISPLAY ii.
|
||||
END.
|
||||
|
|
@ -0,0 +1,6 @@
|
|||
DEF VAR de AS DECIMAL FORMAT "->>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>9" NO-UNDO.
|
||||
|
||||
DO WHILE TRUE:
|
||||
de = de + 1.
|
||||
DISPLAY de.
|
||||
END.
|
||||
8
Task/Integer-sequence/Order/integer-sequence-1.order
Normal file
8
Task/Integer-sequence/Order/integer-sequence-1.order
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
#include <order/interpreter.h>
|
||||
|
||||
#define ORDER_PP_DEF_8printloop ORDER_PP_FN( \
|
||||
8fn(8N, \
|
||||
8do(8print(8to_lit(8N) 8comma 8space), \
|
||||
8printloop(8inc(8N)))) )
|
||||
|
||||
ORDER_PP( 8printloop(1) )
|
||||
8
Task/Integer-sequence/Order/integer-sequence-2.order
Normal file
8
Task/Integer-sequence/Order/integer-sequence-2.order
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
#include <order/interpreter.h>
|
||||
|
||||
#define ORDER_PP_DEF_8printloop ORDER_PP_FN( \
|
||||
8fn(8N, \
|
||||
8do(8print(8to_lit(8N) 8comma 8space), \
|
||||
8when(8less(8N, 99), 8printloop(8inc(8N))))) )
|
||||
|
||||
ORDER_PP( 8printloop(1) ) // 1, ..., 99,
|
||||
1
Task/Integer-sequence/PARI-GP/integer-sequence.pari
Normal file
1
Task/Integer-sequence/PARI-GP/integer-sequence.pari
Normal file
|
|
@ -0,0 +1 @@
|
|||
n=0; while(1,print(++n))
|
||||
5
Task/Integer-sequence/PL-I/integer-sequence.pli
Normal file
5
Task/Integer-sequence/PL-I/integer-sequence.pli
Normal file
|
|
@ -0,0 +1,5 @@
|
|||
infinity: procedure options (main);
|
||||
declare k fixed decimal (30);
|
||||
put skip edit
|
||||
((k do k = 1 to 999999999999999999999999999998))(f(31));
|
||||
end infinity;
|
||||
9
Task/Integer-sequence/Pascal/integer-sequence-1.pascal
Normal file
9
Task/Integer-sequence/Pascal/integer-sequence-1.pascal
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
Program IntegerSequenceLimited;
|
||||
var
|
||||
Number: QWord = 0; // 8 bytes, unsigned: 0 .. 18446744073709551615
|
||||
begin
|
||||
repeat
|
||||
writeln(Number);
|
||||
inc(Number);
|
||||
until false;
|
||||
end.
|
||||
15
Task/Integer-sequence/Pascal/integer-sequence-2.pascal
Normal file
15
Task/Integer-sequence/Pascal/integer-sequence-2.pascal
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
Program IntegerSequenceUnlimited;
|
||||
|
||||
uses
|
||||
gmp;
|
||||
|
||||
var
|
||||
Number: mpz_t;
|
||||
|
||||
begin
|
||||
mpz_init(Number); //* zero now *//
|
||||
repeat
|
||||
mp_printf('%Zd' + chr(13) + chr(10), @Number);
|
||||
mpz_add_ui(Number, Number, 1); //* increase Number *//
|
||||
until false;
|
||||
end.
|
||||
1
Task/Integer-sequence/Perl-6/integer-sequence.pl6
Normal file
1
Task/Integer-sequence/Perl-6/integer-sequence.pl6
Normal file
|
|
@ -0,0 +1 @@
|
|||
.say for 1..*
|
||||
1
Task/Integer-sequence/PostScript/integer-sequence.ps
Normal file
1
Task/Integer-sequence/PostScript/integer-sequence.ps
Normal file
|
|
@ -0,0 +1 @@
|
|||
1 {succ dup =} loop
|
||||
|
|
@ -0,0 +1,5 @@
|
|||
OpenConsole()
|
||||
Repeat
|
||||
a.q+1
|
||||
PrintN(Str(a))
|
||||
ForEver
|
||||
1
Task/Integer-sequence/Retro/integer-sequence.retro
Normal file
1
Task/Integer-sequence/Retro/integer-sequence.retro
Normal file
|
|
@ -0,0 +1 @@
|
|||
0 [ [ putn space ] sip 1+ dup 0 <> ] while drop
|
||||
4
Task/Integer-sequence/Run-BASIC/integer-sequence.run
Normal file
4
Task/Integer-sequence/Run-BASIC/integer-sequence.run
Normal file
|
|
@ -0,0 +1,4 @@
|
|||
while 1
|
||||
i = i + 1
|
||||
print i
|
||||
wend
|
||||
2
Task/Integer-sequence/Salmon/integer-sequence-1.salmon
Normal file
2
Task/Integer-sequence/Salmon/integer-sequence-1.salmon
Normal file
|
|
@ -0,0 +1,2 @@
|
|||
iterate (i; [0...+oo])
|
||||
i!;
|
||||
2
Task/Integer-sequence/Salmon/integer-sequence-2.salmon
Normal file
2
Task/Integer-sequence/Salmon/integer-sequence-2.salmon
Normal file
|
|
@ -0,0 +1,2 @@
|
|||
for (i; 0; true)
|
||||
i!;
|
||||
6
Task/Integer-sequence/Salmon/integer-sequence-3.salmon
Normal file
6
Task/Integer-sequence/Salmon/integer-sequence-3.salmon
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
variable i := 0;
|
||||
while (true)
|
||||
{
|
||||
i!;
|
||||
++i;
|
||||
};
|
||||
11
Task/Integer-sequence/Seed7/integer-sequence-1.seed7
Normal file
11
Task/Integer-sequence/Seed7/integer-sequence-1.seed7
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
$ include "seed7_05.s7i";
|
||||
|
||||
const proc: main is func
|
||||
local
|
||||
var integer: number is 0;
|
||||
begin
|
||||
repeat
|
||||
incr(number);
|
||||
writeln(number);
|
||||
until number = 2147483647;
|
||||
end func;
|
||||
12
Task/Integer-sequence/Seed7/integer-sequence-2.seed7
Normal file
12
Task/Integer-sequence/Seed7/integer-sequence-2.seed7
Normal file
|
|
@ -0,0 +1,12 @@
|
|||
$ include "seed7_05.s7i";
|
||||
include "bigint.s7i";
|
||||
|
||||
const proc: main is func
|
||||
local
|
||||
var bigInteger: number is 1_;
|
||||
begin
|
||||
repeat
|
||||
writeln(number);
|
||||
incr(number);
|
||||
until FALSE;
|
||||
end func;
|
||||
4
Task/Integer-sequence/TUSCRIPT/integer-sequence.tuscript
Normal file
4
Task/Integer-sequence/TUSCRIPT/integer-sequence.tuscript
Normal file
|
|
@ -0,0 +1,4 @@
|
|||
$$ MODE TUSCRIPT
|
||||
LOOP n=0,999999999
|
||||
n=n+1
|
||||
ENDLOOP
|
||||
6
Task/Integer-sequence/UNIX-Shell/integer-sequence.sh
Normal file
6
Task/Integer-sequence/UNIX-Shell/integer-sequence.sh
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
#!/bin/sh
|
||||
num=0
|
||||
while true; do
|
||||
echo $num
|
||||
num=`expr $num + 1`
|
||||
done
|
||||
3
Task/Integer-sequence/Vala/integer-sequence.vala
Normal file
3
Task/Integer-sequence/Vala/integer-sequence.vala
Normal file
|
|
@ -0,0 +1,3 @@
|
|||
uint i = 0;
|
||||
while (++i < uint.MAX)
|
||||
stdout.printf("%u\n", i);
|
||||
|
|
@ -0,0 +1,3 @@
|
|||
For i As Integer = 0 To Integer.MaxValue
|
||||
Console.WriteLine(i)
|
||||
Next
|
||||
8
Task/Integer-sequence/XPL0/integer-sequence.xpl0
Normal file
8
Task/Integer-sequence/XPL0/integer-sequence.xpl0
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
\Displays integers up to 2^31-1 = 2,147,483,647
|
||||
code CrLf=9, IntOut=11;
|
||||
int N;
|
||||
[N:= 1;
|
||||
repeat IntOut(0, N); CrLf(0);
|
||||
N:= N+1;
|
||||
until N<0;
|
||||
]
|
||||
Loading…
Add table
Add a link
Reference in a new issue