zettacode 0.1.0 → 0.1.1

data/zettacode.files/arithmetic.integer/picolisp.txt

@@ -1,8 +1,8 @@
-(d m (A B)
-   ( "A      " (+ A B))
-   ( "Subc " (- A B))
-   ( "Mu " (* A B))
-   ( "D   " ( A B))        # Tuc  z
-   ( "D  " (* A B))       # Ru   
-   ( "Muu  " (% A B))        # S f  f 
-   ( "P    " (** A B)) )
+(de math (A B)
+   (prinl "Add      " (+ A B))
+   (prinl "Subtract " (- A B))
+   (prinl "Multiply " (* A B))
+   (prinl "Divide   " (/ A B))        # Trucates towards zero
+   (prinl "Div/rnd  " (*/ A B))       # Rounds to next integer
+   (prinl "Modulus  " (% A B))        # Sign of the first operand
+   (prinl "Power    " (** A B)) )

data/zettacode.files/arithmetic.integer/piet.txt

@@ -1,38 +1,38 @@
-[[F:PAcI.]]b
- c
- c   c
- ()   A
- uc AA
- uc AAA
- uc AAAA
- uc AAAAA
- ()   BAAAAA
- uc BBAAAAA
- uc BBBAAAAA
- uc BBBBAAAAA
- uc BBBBBAAAAA
- u 9    9BBBBBAAAAA
- u 1    19BBBBBAAAAA
-       BBBBAAAABA
- u 7    7BBBBAAAABA
- u 1    17BBBBAAAABA
-       BBBAAABABA
- u 5    5BBBAAABABA
- u 1    15BBBAAABABA
-       BBAABABABA
- u 3    3BBAABABABA
- u 1    13BBAABABABA
-       BABABABABA
-        (A+B)BABABABA
- u()  BABABABA
- ub       (A-B)BABABA
- u()  BABABA
- u      (A*B)BABA
- u()  BABA
-     (AB)BA
- u()  BA
-        (A%B)
- u()  NULL
- u 1    1
- c
-H u    u   , bu I b    u  0.
+[[File:PietArithmaticInteger.png]]<br>
+ <code>
+ command   stack
+ in(int)   A
+ duplicate AA
+ duplicate AAA
+ duplicate AAAA
+ duplicate AAAAA
+ in(int)   BAAAAA
+ duplicate BBAAAAA
+ duplicate BBBAAAAA
+ duplicate BBBBAAAAA
+ duplicate BBBBBAAAAA
+ push 9    9BBBBBAAAAA
+ push 1    19BBBBBAAAAA
+ roll      BBBBAAAABA
+ push 7    7BBBBAAAABA
+ push 1    17BBBBAAAABA
+ roll      BBBAAABABA
+ push 5    5BBBAAABABA
+ push 1    15BBBAAABABA
+ roll      BBAABABABA
+ push 3    3BBAABABABA
+ push 1    13BBAABABABA
+ roll      BABABABABA
+ add       (A+B)BABABABA
+ out(int)  BABABABA
+ sub       (A-B)BABABA
+ out(int)  BABABA
+ mult      (A*B)BABA
+ out(int)  BABA
+ divide    (A/B)BA
+ out(int)  BA
+ mod       (A%B)
+ out(int)  NULL
+ push 1    1
+ exit</code>
+How rounding is handled is up to the interpreter, but I believe the intent was round towards 0.

data/zettacode.files/arithmetic.integer/pl-i.txt

@@ -1,8 +1,8 @@
- =""
-  (, b)
-u   (+b)
-u   (-b)
-u   (*b)
-u   (uc(b)) * uc  z.       *
-u   ((, b))  * R   . *
-u   ((, b))  * S c b .         *
+<syntaxhighlight lang="pl/i">
+get list (a, b);
+put skip list (a+b);
+put skip list (a-b);
+put skip list (a*b);
+put skip list (trunc(a/b)); /* truncates towards zero.       */
+put skip list (mod(a, b));  /* Remainder is always positive. */
+put skip list (rem(a, b));  /* Sign can be negative.         */

data/zettacode.files/arithmetic.integer/plain_english.txt

@@ -1,26 +1,26 @@
-To u:
-S u.
-D  c.
-W f  c .
-Su .
+To run:
+Start up.
+Demonstrate integer arithmetic.
+Wait for the escape key.
+Shut down.
 
-T   c:
-W "E  ub: "   c u c.
-R  ub f  c.
-W "E  ub: "   c u c.
-R  ub f  c.
-S  c  b  ub    ub.
+To demonstrate integer arithmetic:
+Write "Enter a number: " to the console without advancing.
+Read a number from the console.
+Write "Enter another number: " to the console without advancing.
+Read another number from the console.
+Show the arithmetic operations between the number and the other number.
 
-T   c  b  ub   ub:
-W  ub u   ub  "   u."   c.
-W  ub u   ub  "   ffc."   c.
-W  ub    ub  "   uc."   c.
-S   f  ub b   ub.
-R  ub    ub.
-W  ub  "   ."   c.
+To show the arithmetic operations between a number and another number:
+Write the number plus the other number then " is the sum." to the console.
+Write the number minus the other number then " is the difference." to the console.
+Write the number times the other number then " is the product." to the console.
+Show the division of the number by the other number.
+Raise the number to the other number.
+Write the number then " is the power." to the console.
 
-T    f  ub b  ub:
-Pz  ub.
-D  ub b   ub   qu [u  z]    [      ].
-W  qu  "   qu."   c.
-W    "   ."   c.
+To show the division of a number by another number:
+Privatize the number.
+Divide the number by the other number giving a quotient [rounding toward zero] and a remainder [with the same sign as the dividend].
+Write the quotient then " is the quotient." to the console.
+Write the remainder then " is the remainder." to the console.

data/zettacode.files/arithmetic.integer/pop11.txt

@@ -1,12 +1,12 @@
 
- Su ok d
- 
-c(c) - 
-   ub
-  = (), b = ()
- P u
-f( + b, ' + b = %\')
-f( - b, ' - b = %\')
-f( * b, ' * b = %\')
-f(  b, '  b = %\')
-f(  b, '  b = %\')
+;;; Setup token reader
+vars itemrep;
+incharitem(charin) -> itemrep;
+;;; read the numbers
+lvars a = itemrep(), b = itemrep();
+;;; Print results
+printf(a + b, 'a + b = %p\n');
+printf(a - b, 'a - b = %p\n');
+printf(a * b, 'a * b = %p\n');
+printf(a div b, 'a div b = %p\n');
+printf(a mod b, 'a mod b = %p\n');

data/zettacode.files/arithmetic.integer/postscript.txt

@@ -1,10 +1,10 @@
-I {
-    c f
-    c f
-      =
-     ub =
-     u =
-      =
-      =
-      =
-} f
+/arithInteger {
+   /x exch def
+   /y exch def
+   x y add =
+   x y sub =
+   x y mul =
+   x y idiv =
+   x y mod =
+   x y exp =
+} def

data/zettacode.files/arithmetic.integer/powershell.txt

@@ -1,15 +1,15 @@
-$ = [] (Rd-Ho F Numb)
-$b = [] (R-H Sc Nub)
+$a = [int] (Read-Host First Number)
+$b = [int] (Read-Host Second Number)
 
-W-H "Su:                              $($ + $b)"
-W-H "Dffc:                       $($ - $b)"
-W-H "Puc:                          $($ * $b)"
-W-H "Qu:                         $($  $b)"
-W-H "Qu, u  :          $([M]::Ru($  $b))"
-W-H "R,  f f:    $($ % $b)"
-Nub  uc c  cc f  u. T     I32  b   I64 bu    - qu  cu  u  b f  f- .
+Write-Host "Sum:                              $($a + $b)"
+Write-Host "Difference:                       $($a - $b)"
+Write-Host "Product:                          $($a * $b)"
+Write-Host "Quotient:                         $($a / $b)"
+Write-Host "Quotient, round to even:          $([Math]::Round($a / $b))"
+Write-Host "Remainder, sign follows first:    $($a % $b)"
+Numbers are automatically converted to accomodate for the result. This means not only that Int32 will be expanded to Int64 but also that a non-integer quotient will cause the result to be of a floating-point type.
 
-T     f  f .
+The remainder has the sign of the first operand.
 
-N   , bu c b  u   .NET BCL:
-[M]::Pow($, $b)
+No exponentiation operator exists, but can be worked around with the .NET BCL:
+[Math]::Pow($a, $b)

data/zettacode.files/arithmetic.integer/processing.txt

@@ -1,7 +1,7 @@
-  = 7, b = 5
+int a = 7, b = 5;
 
-( + " + " + b + " = " + ( + b))
-( + " - " + b + " = " + ( - b))
-( + " * " + b + " = " + ( * b))
-( + "  " + b + " = " + (  b)) Ru  z
-( + " % " + b + " = " + ( % b)) S   f 
+println(a + " + " + b + " = " + (a + b));
+println(a + " - " + b + " = " + (a - b));
+println(a + " * " + b + " = " + (a * b));
+println(a + " / " + b + " = " + (a / b)); //Rounds towards zero
+println(a + " % " + b + " = " + (a % b)); //Same sign as first operand

data/zettacode.files/arithmetic.integer/prodos.txt

@@ -1,35 +1,35 @@
-IGNORELINE No: T m cud  m modu.
-cu cu
-:
-  u= =E f : 
-  u=b =E c :
-  u=c 
-  --,-b-=-c-
- -c-
- ubc ,b
- -c-
- u ,b
- -c-
-  ,b
- -c-
- uu ,b
- -c-
-  u= =D u   ccu  ub?
-f -- u   :   :
-:
+IGNORELINE Note: This example includes the math module.
+include arithmeticmodule
+:a
+editvar /newvar /value=a /title=Enter first integer: 
+editvar /newvar /value=b /title=Enter second integer:
+editvar /newvar /value=c 
+do add -a-,-b-=-c-
+printline -c-
+do subtract a,b
+printline -c-
+do multiply a,b
+printline -c-
+do divide a,b
+printline -c-
+do modulus a,b
+printline -c-
+editvar /newvar /value=d /title=Do you want to calculate more numbers?
+if -d- /hasvalue yes goto :a else goto :end
+:end
 
-IGNORELINE No: T m do o u  m modu.
-:
-  u= =E f : 
-  u=b =E c :
-  u=--+-b-=-c-
- -c-
-  u=*b=c
- -c-
-  u=b=c
- -c-
-  u= %% b=c
- -c-
-  u= =D u   ccu  ub?
-f -- u   :   :
-:
+IGNORELINE Note: This example does not use the math module.
+:a
+editvar /newvar /value=a /title=Enter first integer: 
+editvar /newvar /value=b /title=Enter second integer:
+editvar /newvar /value=-a-+-b-=-c-
+printline -c-
+editvar /newvar /value=a*b=c
+printline -c-
+editvar /newvar /value=a/b=c
+printline -c-
+editvar /newvar /value=a %% b=c
+printline -c-
+editvar /newvar /value=d /title=Do you want to calculate more numbers?
+if -d- /hasvalue yes goto :a else goto :end
+:end

data/zettacode.files/arithmetic.integer/prolog.txt

@@ -1,33 +1,33 @@
 
-I qu (``) u  0.
+Integer quotient (`//`) rounds towards 0.
 
-R (``) c   f  f .
+Remainder (`rem`) matches the sign of its first operand.
 
 
 
-___u(M, N, O) :-
-    E =.. [O, M, N],
-    Ru  E,
-    f('~ ~8| ~~', [E, Ru]).
+print_expression_and_result(M, N, Operator) :-
+    Expression =.. [Operator, M, N],
+    Result is Expression,
+    format('~w ~8|is ~d~n', [Expression, Result]).
 
-c_ :-
-    (M),
-    (N),
-    ( ___u(M, N), [+,-,*,,,^] ).
+arithmetic_integer :-
+    read(M),
+    read(N),
+    maplist( print_expression_and_result(M, N), [+,-,*,//,rem,^] ).
 
 
 
-U u:
+Use thus:
 
 
-?- c_.
+?- arithmetic_integer.
 |: 5.
 |: 7.
-5+7      12
-5-7      -2
-5*7      35
-57     0
-5  7  5
-5^7      78125
-u.
+5+7     is 12
+5-7     is -2
+5*7     is 35
+5//7    is 0
+5 rem 7 is 5
+5^7     is 78125
+true.
 

data/zettacode.files/arithmetic.integer/purebasic.txt

@@ -1,17 +1,17 @@
-OCoo()
+OpenConsole()
  
-Df , b
+Define a, b
 
-P("Nub 1: "):  = V(Iu())
-P("Nub 2: "): b = V(Iu())
+Print("Number 1: "): a = Val(Input())
+Print("Number 2: "): b = Val(Input())
 
-PN("Su:        " + S( + b))
-PN("Dffc: " + S( - b))
-PN("Puc:    " + S( * b))
-PN("Qu:   " + S(  b))  I  (u =uc)
-PN("R: " + S( % b))
-PN("P:      " + S(P(, b)))
+PrintN("Sum:        " + Str(a + b))
+PrintN("Difference: " + Str(a - b))
+PrintN("Product:    " + Str(a * b))
+PrintN("Quotient:   " + Str(a / b)) ; Integer division (rounding mode=truncate)
+PrintN("Remainder: " + Str(a % b))
+PrintN("Power:      " + Str(Pow(a, b)))
  
-Iu()
+Input()
  
-CC()
+CloseConsole()

data/zettacode.files/arithmetic.integer/python.txt

@@ -1,47 +1,47 @@
 
- = (w_u("Numb 1: "))
- = (_u("Nub 2: "))
-
- "Su: %" % ( + )
- "Dffc: %" % ( - )
- "Puc: %" % ( * )
- "Qu: %" % (  )     #       f   .
-                                   # uc   f
- "R: %" % ( % )    #    c 
- "Qu: %  R: %" % (, )
- "P: %" % **
-
-## O u     u    
-_u( )
-
-N: I P3 ''_u()''  b   ''u()'' (  ''u()'' bu-   , u  cu u ''(u())''  u   ...  - ... b).  A  b  u    ''()'' c   '': ... c VuE:...'' cuc uc :
-
-df um(om):
-     Tu: #  ...
-        :
-             = (_u())
-        c VuE:
-             "Iu cu  b    . P  ."\
-            cu
-        b
-    u 
-
- = u("Nub1: ")
- = u("Nub2: ")
+x = int(raw_input("Number 1: "))
+y = int(raw_input("Number 2: "))
+
+print "Sum: %d" % (x + y)
+print "Difference: %d" % (x - y)
+print "Product: %d" % (x * y)
+print "Quotient: %d" % (x / y)     #  or x // y  for newer python versions.
+                                   # truncates towards negative infinity
+print "Remainder: %d" % (x % y)    # same sign as second operand
+print "Quotient: %d with Remainder: %d" % divmod(x, y)
+print "Power: %d" % x**y
+
+## Only used to keep the display up when the program ends
+raw_input( )
+
+Notes: In Python3 ''raw_input()'' will be renamed to ''input()'' (the old ''input()'' built-in will go away, though one could use ''eval(input())'' to emulate the old ... and ill-advised ... behavior).  Also a better program would wrap the attempted ''int()'' conversions in a ''try: ... except ValueError:...'' construct such as:
+
+def getnum(prompt):
+    while True: # retrying ...
+        try:
+            n = int(raw_input(prompt))
+        except ValueError:
+            print "Input could not be parsed as an integer. Please try again."\
+            continue
+        break
+    return n
+
+x = getnum("Number1: ")
+y = getnum("Number2: ")
 ...
 
-(I  '  cc  f  f  u  c  bc.  T  c u f c u u, bu      f cfu   f,   f  c   IPC c).
+(In general it's good practice to perform parsing of all input in exception handling blocks.  This is especially true of interactive user input, but also applies to data read from configuration and other files, and marshaled from other processes via any IPC mechanism).
 
-P    cu ''''  u b qu  . 
- qu,  = (355,113)
-G  qu f 3,    f 16. 
+Python also has the procedure ''divmod'' that returns both quotient and remainder. eg
+ quotient, remainder = divmod(355,113)
+Giving a quotient of 3, and a remainder of 16. 
 
-=== P 3.0 cb c ===
-df mc(, ):
-    f   "+ - *  % **".():
-         = "%() %() %()" % ()
-        ("%\= %" % (, ()))
+=== Python 3.0 compatible code ===
+def arithmetic(x, y):
+    for op in "+ - * // % **".split():
+        expr = "%(x)s %(op)s %(y)s" % vars()
+        print("%s\t=> %s" % (expr, eval(expr)))
 
 
-c(12, 8)
-c(u("Nub 1: "), u("Nub 2: "))
+arithmetic(12, 8)
+arithmetic(input("Number 1: "), input("Number 2: "))

data/zettacode.files/arithmetic.integer/qb64.txt

@@ -1,21 +1,21 @@
-''CBTJD'': 20200312
+''CBTJD'': 2020/03/12
 START:
-INPUT "E   (,b):" !, b!
-IF  = 0 THEN END
+INPUT "Enter two integers (a,b):"; a!, b!
+IF a = 0 THEN END
 IF b = 0 THEN
-    PRINT "Sc   z. Z   f Qu  R."
+    PRINT "Second integer is zero. Zero not allowed for Quotient or Remainder."
     GOTO START
 END IF
 PRINT
-PRINT "             Su = "  + b
-PRINT "      Dffc = "  - b
-PRINT "         Puc = "  * b
-' Nc  u f  INTEGER D "\"     u  "".
-PRINT "I Qu = "  \ b, , "* Ru  0."
-PRINT "       R = "  MOD b, , "* S c f ."
-PRINT "  E = "  ^ b
+PRINT "             Sum = "; a + b
+PRINT "      Difference = "; a - b
+PRINT "         Product = "; a * b
+' Notice the use of the INTEGER Divisor "\" as opposed to the regular divisor "/".
+PRINT "Integer Quotient = "; a \ b, , "* Rounds toward 0."
+PRINT "       Remainder = "; a MOD b, , "* Sign matches first operand."
+PRINT "  Exponentiation = "; a ^ b
 PRINT
-INPUT "A? (N)" $
-IF UCASE$($) = "Y" THEN CLS: GOTO START
+INPUT "Again? (y/N)"; a$
+IF UCASE$(a$) = "Y" THEN CLS: GOTO START
 CLS
 END

data/zettacode.files/arithmetic.integer/quackery.txt

@@ -1,12 +1,12 @@
 
- ="quc "  $ "P     b  c. "
-  u quc
-  2u  "T u :              " +    c c
-  2u  "T ffc :       " -    c c
-  2u  "T uc : "        " *    c c
-  2u  "T  qu : "     c c
-  2u  "T  :        "   c c
-        "T  :   " **   c c
-  c
-   "Qu u   f." c
-   "R c   f  c u."
+<syntaxhighlight lang="quackery ">  $ "Please enter two integers separated by a space. "
+  input quackery
+  2dup say "Their sum is:              " +    echo cr
+  2dup say "Their difference is:       " -    echo cr
+  2dup say "Their product is: "        " *    echo cr
+  2dup say "Their integer quotient is: " /    echo cr
+  2dup say "Their remainder is:        " mod  echo cr
+       say "Their exponentiation is:   " **   echo cr
+  cr
+  say "Quotient rounds towards negative infinity." cr
+  say "Remainder matches the sign of the second argument."

data/zettacode.files/arithmetic.integer/r.txt

@@ -1,11 +1,11 @@
-c(" umb ")
- - c(=1, qu=TRUE)
-c(" ub ")
-b - c(=1, qu=TRUE)
-(('+b=', +b))
-(('-b=', -b))
-(('*b=', *b))
-(('%%b=', %%b))
-(('%%b=', %%b))
-(('^b=', ^b))
+cat("insert number ")
+a <- scan(nmax=1, quiet=TRUE)
+cat("insert number ")
+b <- scan(nmax=1, quiet=TRUE)
+print(paste('a+b=', a+b))
+print(paste('a-b=', a-b))
+print(paste('a*b=', a*b))
+print(paste('a%/%b=', a%/%b))
+print(paste('a%%b=', a%%b))
+print(paste('a^b=', a^b))
 

data/zettacode.files/arithmetic.integer/racket.txt

@@ -1,8 +1,8 @@
 
-# cb
+#lang racket/base
 
-(f (c  )
-  (f ([ ( + - *  qu  u   c c)])
-    (f "~ = ~\" `(,(bjc- ) , ,) (  ))))
+(define (arithmetic x y)
+  (for ([op (list + - * / quotient remainder modulo max min gcd lcm)])
+    (printf "~s => ~s\n" `(,(object-name op) ,x ,y) (op x y))))
 
-(c 8 12)
+(arithmetic 8 12)

data/zettacode.files/arithmetic.integer/raku.txt

@@ -1,12 +1,12 @@
-(f P 6)
+(formerly Perl 6)
 
-N  cc bqub  u. If u      ,  cf($$b)c.
- ="u"  I $ = .f
- I $b = .f
+Note that <code>div</code> <b>requires</b> integer arguments. If you want integer division with other types, say <code>floor($a/$b)</code>.
+<syntaxhighlight lang="raku" line>my Int $a = get.floor;
+my Int $b = get.floor;
 
- 'u:              ', $ + $b
- 'ffc:       ', $ - $b
- 'uc:          ', $ * $b
- ' qu: ', $  $b
- ':        ', $ % $b
- ':   ', $**$b
+say 'sum:              ', $a + $b;
+say 'difference:       ', $a - $b;
+say 'product:          ', $a * $b;
+say 'integer quotient: ', $a div $b;
+say 'remainder:        ', $a % $b;
+say 'exponentiation:   ', $a**$b;