Cistercian numerals: Difference between revisions

:* '''[https://www.youtube.com/watch?v=9p55Qgt7Ciw Numberphile - The Forgotten Number System]'''

:* '''[https://www.dcode.fr/cistercian-numbers dcode.fr - Online Cistercian numeral converter]'''

 

 

=={{header|AWK}}==

# syntax: GAWK -f CISTERCIAN_NUMERALS.AWK [-v debug={0|1}] [-v xc=anychar] numbers 0-9999 ...

#

if (debug == 1) { printf("%s\n",header) }

}

{{out}}

<pre style="height: 60ex; overflow: scroll">

invalid

</pre>

=={{header|C}}==

{{trans|C#}}

 

#define GRID_SIZE 15

 

return 0;

{{out}}

<pre>0:

x x x

xxxxxxxxxxx</pre>

=={{header|C++}}==

{{trans|Go}}

#include <iostream>

 

 

return 0;

{{out}}

<pre>0:

x x x

xxxxxxxxxxx</pre>

=={{header|D}}==

{{trans|Java}}

 

class Cistercian {

writeln(c);

}

{{out}}

<pre>0:

x x x

xxxxxxxxxxx</pre>

 

=={{header|F_Sharp|F#}}==

// Cistercian numerals. Nigel Galloway: February 2nd., 2021

let N=[|[[|' ';' ';' '|];[|' ';' ';' '|];[|' ';' ';' '|]];

 

[(0,0,0,0);(0,0,0,1);(0,0,2,0);(0,3,0,0);(4,0,0,0);(5,5,5,5);(6,7,8,9)]|>List.iter(fun(i,g,e,l)->printfn "\n%d%d%d%d\n____" i g e l; fN i g e l)

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2020-08-14}}

literals math.order math.text.utils multiline sequences

splitting ;

with-datastack [ ] [ overwrite ] map-reduce [ print ] each ;

 

{{out}}

<pre style="height: 60ex; overflow: scroll">

+ +

</pre>

 

=={{header|Go}}==

{{trans|Wren}}

 

import "fmt"

printNumeral()

}

 

{{out}}

Same as Wren example.

</pre>

=={{header|J}}==

Program writes a scalable vector graphics file containing all composable numbers. J code is alongside the original python source.

</pre>

The <tt>rc</tt> verb writes <tt>RC=. 0 1 20 300 666 4000 5555 6789</tt>

NB. http://rosettacode.org/wiki/Cistercian_numerals

NB. converted from

'open browser to {}{}{}' format~ (pwd'') ; PATHJSEP_j_ ; y

)

=={{header|Java}}==

{{trans|Kotlin}}

import java.util.List;

 

}

}

{{out}}

<pre>0:

x x x

xxxxxxxxxxx </pre>

=={{header|JavaScript}}==

Using a canvas.

// html

document.write(`

}

}

{{out}}<pre>

https://jsfiddle.net/43tsmn9z</pre>

 

=={{header|Julia}}==

Gtk graphic version.

 

const can = GtkCanvas(800, 100)

 

mooncipher()

 

=={{header|Kotlin}}==

{{trans|C++}}

 

class Cistercian() {

}

 

{{out}}

<pre>0:

x x x

xxxxxxxxxxx </pre>

=={{header|Lua}}==

{{trans|Go}}

local n = {}

for i=1,15 do

end

 

{{out}}

<pre>0:

x x x

x x x x x x x x x x x</pre>

=={{header|Mathematica}}/{{header|Wolfram Language}}==

\[Delta] = 0.25;

CistercianNumberEncodeHelper[0] := {}

CistercianNumberEncode[5555]

CistercianNumberEncode[6789]

{{out}}

A set of Graphics is shown for each of the numerals.

=={{header|Nim}}==

{{trans|Kotlin}}

 

type Canvas = array[Size, array[Size, char]]

for number in [0, 1, 20, 300, 4000, 5555, 6789, 9999]:

echo number, ':'

 

{{out}}

xxxxxxxxxxx

</pre>

 

 

 

 

{{out}}

<pre>

| + / | +-+-+ | +-+ +-+ +-+-+ +-+-+

</pre>

=={{header|Plain English}}==

Start up.

Show some example Cistercian numbers.

To stroke nine:

Stroke 1.

{{out}}

https://commons.wikimedia.org/wiki/File:Cistercian_numerals.png

=={{header|Python}}==

I tried to create a three-line font from UTF8 characters taking three lines per Cistercian number.

"""

Some UTF-8 chars used:

for n in numbers[1:]:

lines = cjoin(lines, num_to_lines(n))

 

{{out}}

The pre tag may have to shift from one monospace font to a second that contains a character missing from the first. Those two individually monospaced fonts may have differing character widths between fonts (although consistent within individual monospaced fonts).<br>

Paste the output into a monospace code editor and the stems of each number might well align!

 

=={{header|Raku}}==

Handles 0 through 9999 only. No error trapping. If you feed it an unsupported number it will truncate to maximum 4 digits.

 

(0, 0, 35, 0), (0, 35, 35, 35), (0, 0, 35, 35), (0, 35, 35, 0), ( 35, 0, 35, 35),

(0, 0,-35, 0), (0, 35,-35, 35), (0, 0,-35, 35), (0, 35,-35, 0), (-35, 0,-35, 35),

 

}

 

=={{header|REXX}}==

 

Comprehensive error checking was also included.

parse arg m /*obtain optional arguments from the CL*/

if m='' | m="," then m= 0 1 20 300 4000 5555 6789 9393 /*Not specified? Use defaults.*/

if q==2 then call p -5, 5, '└', -5, 9, "┌"

if q==3 then call p 5, 0, '┘', 5, 4, "┐"

{{out|output|text=&nbsp; when using the default inputs:}}

(Shown at three-quarter size.)

│ │ │ │/ / │ ─────┴───── │ └────┘ └────┘/

</pre>

=={{header|Ruby}}==

{{trans|Lua}}

n = Array.new(15){Array.new(11, ' ')}

for i in 1..15

end

printNumeral(n)

{{out}}

<pre>0:

x x x

xxxxxxxxxxx</pre>

 

=={{header|Wren}}==

{{libheader|Wren-fmt}}

This draws each Cistercian numeral on the terminal within a grid of 15 rows by 11 columns. The vertical line segment is drawn at column 5 (zero indexed) so there are 5 columns at either side.

 

var n

Fmt.mprint(n, 1, 0, "")

System.print()

 

{{out}}