September 2017 Update
This commit is contained in:
parent
bba7bfd280
commit
ba8067c3b7
14570 changed files with 153136 additions and 63871 deletions
6
Task/Integer-sequence/Batch-File/integer-sequence.bat
Normal file
6
Task/Integer-sequence/Batch-File/integer-sequence.bat
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
@echo off
|
||||
set number=0
|
||||
:loop
|
||||
set /a number+=1
|
||||
echo %number%
|
||||
goto loop
|
||||
1
Task/Integer-sequence/Bc/integer-sequence.bc
Normal file
1
Task/Integer-sequence/Bc/integer-sequence.bc
Normal file
|
|
@ -0,0 +1 @@
|
|||
while (++i) i
|
||||
2
Task/Integer-sequence/Beeswax/integer-sequence-1.beeswax
Normal file
2
Task/Integer-sequence/Beeswax/integer-sequence-1.beeswax
Normal file
|
|
@ -0,0 +1,2 @@
|
|||
qNP<
|
||||
_1>{d
|
||||
1
Task/Integer-sequence/Beeswax/integer-sequence-2.beeswax
Normal file
1
Task/Integer-sequence/Beeswax/integer-sequence-2.beeswax
Normal file
|
|
@ -0,0 +1 @@
|
|||
_1F6~@{PN@J
|
||||
|
|
@ -1,10 +1,10 @@
|
|||
' FB 1.05.0 Win64
|
||||
|
||||
' FB does not natively support arbitrarily large integers though support can be added
|
||||
' by using an external library such as GMP. For now we will just use an unsigned long integer.
|
||||
' by using an external library such as GMP. For now we will just use an unsigned integer (32bit).
|
||||
|
||||
Print "Press Ctrl + C to stop the program at any time"
|
||||
Dim i As Long = 1
|
||||
Dim i As UInteger = 1
|
||||
|
||||
Do
|
||||
Print i
|
||||
|
|
|
|||
|
|
@ -1,8 +0,0 @@
|
|||
// 32-bit 2's-complement signed integer (int/Integer)
|
||||
for (def i = 1; i > 0; i++) { println i }
|
||||
|
||||
// 64-bit 2's-complement signed integer (long/Long)
|
||||
for (def i = 1L; i > 0; i+=1L) { println i }
|
||||
|
||||
// Arbitrarily-long binary signed integer (BigInteger)
|
||||
for (def i = 1g; ; i+=1g) { println i }
|
||||
2
Task/Integer-sequence/HolyC/integer-sequence.holyc
Normal file
2
Task/Integer-sequence/HolyC/integer-sequence.holyc
Normal file
|
|
@ -0,0 +1,2 @@
|
|||
U64 i = 0;
|
||||
while (++i) Print("%d\n", i);
|
||||
15
Task/Integer-sequence/Kotlin/integer-sequence.kotlin
Normal file
15
Task/Integer-sequence/Kotlin/integer-sequence.kotlin
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
import java.math.BigInteger
|
||||
|
||||
// version 1.0.5-2
|
||||
|
||||
fun main(args: Array<String>) {
|
||||
// print until 2147483647
|
||||
(0..Int.MAX_VALUE).forEach { println(it) }
|
||||
|
||||
// print forever
|
||||
var n = BigInteger.ZERO
|
||||
while (true) {
|
||||
println(n)
|
||||
n += BigInteger.ONE
|
||||
}
|
||||
}
|
||||
|
|
@ -1,4 +0,0 @@
|
|||
var i:int64 = 0
|
||||
while true:
|
||||
i = i + 1
|
||||
echo(i)
|
||||
5
Task/Integer-sequence/PILOT/integer-sequence.pilot
Normal file
5
Task/Integer-sequence/PILOT/integer-sequence.pilot
Normal file
|
|
@ -0,0 +1,5 @@
|
|||
C :n = 1
|
||||
*InfiniteLoop
|
||||
T :#n
|
||||
C :n = n + 1
|
||||
J :*InfiniteLoop
|
||||
5
Task/Integer-sequence/XLISP/integer-sequence.xlisp
Normal file
5
Task/Integer-sequence/XLISP/integer-sequence.xlisp
Normal file
|
|
@ -0,0 +1,5 @@
|
|||
(defun integer-sequence-from (x)
|
||||
(print x)
|
||||
(integer-sequence-from (+ x 1)) )
|
||||
|
||||
(integer-sequence-from 1)
|
||||
3
Task/Integer-sequence/Zkl/integer-sequence.zkl
Normal file
3
Task/Integer-sequence/Zkl/integer-sequence.zkl
Normal file
|
|
@ -0,0 +1,3 @@
|
|||
[1..].pump(Console.println) // eager
|
||||
m:=(1).MAX; [1..m].pump(Console.println) // (1).MAX is 9223372036854775807
|
||||
[1..].pump(100,Console.println) // lazy
|
||||
Loading…
Add table
Add a link
Reference in a new issue